A network approach for specially structured linear programs arising in 0-1 quadratic optimization
From MaRDI portal
Publication:943852
DOI10.1016/j.dam.2007.08.035zbMath1163.90653OpenAlexW1988156950MaRDI QIDQ943852
Warren P. Adams, Paul T. Hadavas
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.035
Related Items
Cites Work
- Unnamed Item
- Pseudo-Boolean optimization
- Efficient bounds for the stable set, vertex cover and set packing problems
- An extension of the König-Egerváry property to node-weighted bidirected graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Testing the necklace condition for shortest tours and optimal factors in the plane
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- The cut polytope and the Boolean quadric polytope
- Persistency in 0-1 Polynomial Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Roof duality for polynomial 0–1 optimization
- L’algebre de Boole et ses applications en recherche operationnelle
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Vertex packings: Structural properties and algorithms
- On the integer-valued variables in the linear vertex packing problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- A Selection Problem of Shared Fixed Costs and Network Flows
