Copertina

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Warme, David M.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C10, 90C11, 90C27, 05A15 G.2.1; G.2.2; G.1.6
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
di: Warme, David M.
Pubblicazione: (2024)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
di: Circelli, Michele
Pubblicazione: (2026)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
di: Hikima, Yuya, et al.
Pubblicazione: (2024)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
di: Cheng, Cong-Dian
Pubblicazione: (2017)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
di: Neira, David E. Bernal, et al.
Pubblicazione: (2021)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
di: Bui, Quang Minh, et al.
Pubblicazione: (2022)

Measuring diversity. A review and an empirical analysis
di: Parreño, Francisco, et al.
Pubblicazione: (2024)

Polyhedral approach to weighted connected matchings in general graphs
di: Samer, Phillippe, et al.
Pubblicazione: (2023)

A Polyhedral Perspective on the Perfect Matching Lattice
di: Silina, Olha
Pubblicazione: (2025)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
di: Halemane, Keshava Prasad
Pubblicazione: (2014)

An improved approximation algorithm for k-Median
di: Young, Neal E.
Pubblicazione: (2025)

On the characterization of graphs with tree 3-spanners
di: Lin, Lan, et al.
Pubblicazione: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
di: Gratton, Serge, et al.
Pubblicazione: (2026)

Comparative Evaluation of SDP, SOCP, and QC Convex Relaxations for Large-Scale Market-Based AC Optimal Power Flow
di: Keskin, Ata
Pubblicazione: (2026)

A simple algorithm for the simple bilevel programming (SBP) problem
di: Dempe, Stephan, et al.
Pubblicazione: (2025)

Enhancing Model Based Derivative Free Optimization using Direct Search
di: Li, Zijun, et al.
Pubblicazione: (2026)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
di: Li, Zijun, et al.
Pubblicazione: (2026)

Adaptive Conditional Forest Sampling for Spectral Risk Optimisation under Decision-Dependent Uncertainty
di: Kurbucz, Marcell T.
Pubblicazione: (2026)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
di: Gao, Yan, et al.
Pubblicazione: (2025)

Nonlinear PageRank Problem for Local Graph Partitioning
di: Kodsi, Costy, et al.
Pubblicazione: (2024)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
di: Gratton, S., et al.
Pubblicazione: (2022)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
di: Gratton, S., et al.
Pubblicazione: (2026)

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network
di: Banerjee, Santanu, et al.
Pubblicazione: (2025)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
di: Zhu, Wenqi, et al.
Pubblicazione: (2026)

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

PRIME: Efficient Algorithm for Token Graph Routing Problem
di: Xu, Haotian, et al.
Pubblicazione: (2026)

An inexact infeasible arc-search interior-point method for linear optimization problems
di: Iida, Einosuke, et al.
Pubblicazione: (2024)

LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
di: Xu, Jinyu, et al.
Pubblicazione: (2026)

A random-key GRASP for combinatorial optimization
di: Chaves, Antonio A., et al.
Pubblicazione: (2024)

Random-key genetic algorithms: Principles and applications
di: Londe, Mariana A., et al.
Pubblicazione: (2025)

Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games
di: Ali, Alejandro Mata
Pubblicazione: (2025)

A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters
di: Censor, Yair, et al.
Pubblicazione: (2022)

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
di: Babu, Anand, et al.
Pubblicazione: (2026)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
di: Jin, Tao, et al.
Pubblicazione: (2025)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
di: Fu, Wenhao, et al.
Pubblicazione: (2023)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
di: Cunha, Luís Felipe I., et al.
Pubblicazione: (2025)