Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
From MaRDI portal
Publication:1748494
DOI10.1155/2016/5017369zbMath1387.90153OpenAlexW2513208540WikidataQ59122792 ScholiaQ59122792MaRDI QIDQ1748494
Babak Moazzez, Kevin K. H. Cheung
Publication date: 11 May 2018
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/5017369
Related Items (1)
Uses Software
Cites Work
- Lifting, tilting and fractional programming revisited
- Integrated methods for optimization
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- Certification of an optimal TSP tour through 85,900 cities
- Subadditive approaches in integer programming
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- Minimal inequalities
- Integer programming duality: Price functions and sensitivity analysis
- The value function of an integer program
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Some continuous functions related to corner polyhedra, II
- Unnamed Item
- Unnamed Item
This page was built for publication: Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions