Image de couverture de livre

Generalizations of Total Dual Integrality

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Guenin, Bertrand, Tunçel, Levent
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Optimization and Control 90C57, 90C10, 90C27
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The rainbow covering number of clean tangled clutters
par: Abdi, Ahmad, et autres
Publié: (2025)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2025)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
par: da Silva, Renan F. F., et autres
Publié: (2023)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2025)

Steiner Cut Dominants
par: Conforti, Michele, et autres
Publié: (2022)

Finding Short Paths on Simple Polytopes
par: Black, Alexander E., et autres
Publié: (2026)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
par: Bhadoriya, Abhay Singh, et autres
Publié: (2024)

Integral bases, perfect matchings, and the Petersen graph
par: Abdi, Ahmad, et autres
Publié: (2025)

Cutting planes for signomial programming
par: Xu, Liding, et autres
Publié: (2022)

Linear Decision Tree Policies for Integer Linear Programs
par: Guyard, Théo, et autres
Publié: (2026)

Everything is possible: constructing spectrahedra with prescribed facial dimensions
par: Roshchina, Vera, et autres
Publié: (2023)

Assignment-Routing Optimization : Efficient Heuristic Solver with Shaking Algorithm
par: Qilong, Yuan, et autres
Publié: (2025)

Relaxations for binary polynomial optimization via signed certificates
par: Xu, Liding, et autres
Publié: (2024)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
par: Yuan, Qilong
Publié: (2025)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
par: Brandt, Tabea, et autres
Publié: (2023)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
par: Bencheikh, Ali, et autres
Publié: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
par: Yang, Dominic, et autres
Publié: (2025)

An Integer Linear Programming Model for the Evolomino Puzzle
par: Nikolaev, Andrei V., et autres
Publié: (2026)

Implied Integrality in Mixed-Integer Optimization
par: van der Hulst, Rolf, et autres
Publié: (2025)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
par: Nikolaev, Andrei V., et autres
Publié: (2022)

Binary Cyclic Transversal Polytopes
par: Frede, Jonas, et autres
Publié: (2024)

An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-α Optimization
par: Yuan, Qilong
Publié: (2025)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
par: Murota, Kazuo, et autres
Publié: (2025)

Semidefinite approximations for bicliques and biindependent pairs
par: Laurent, Monique, et autres
Publié: (2023)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
par: Kim, Junyoung, et autres
Publié: (2024)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
par: Dahl, Joachim, et autres
Publié: (2025)

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
par: Engelhardt, Max, et autres
Publié: (2025)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
par: Borgwardt, Steffen, et autres
Publié: (2024)

Competing for the most profitable tour: The orienteering interdiction game
par: Álvarez-Miranda, Eduardo, et autres
Publié: (2024)

Box Allocation Optimization in Meal Kit Delivery
par: Nguyen, Thi Minh Thu, et autres
Publié: (2025)

Duality of Hoffman constants
par: Pena, Javier F., et autres
Publié: (2023)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
par: Jung, Woosuk L., et autres
Publié: (2023)

A Successive Refinement Algorithm for Tri-Level Stochastic Defender-Attacker Problems with Decision-Dependent Probability Distributions
par: Affar, Samuel, et autres
Publié: (2024)

A simple iterative algorithm for maxcut
par: Shao, Sihong, et autres
Publié: (2018)

Continuous iterative algorithms for anti-Cheeger cut
par: Shao, Sihong, et autres
Publié: (2021)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
par: Tanınmış, Kübra, et autres
Publié: (2023)

Production optimization by agents of differing work rates
par: Higgins, Peter M.
Publié: (2023)

Exact Decomposition Branching exploiting Lattice Structures
par: Halbig, Katrin, et autres
Publié: (2024)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
par: Bestuzheva, Ksenia, et autres
Publié: (2022)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
par: Legault, Robin, et autres
Publié: (2022)