Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
DOI10.1016/J.DAM.2019.11.021zbMATH Open1483.90081OpenAlexW2998244089WikidataQ114191509 ScholiaQ114191509MaRDI QIDQ2064286FDOQ2064286
Authors: Matthias Köppe, Jiawei Wang 
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.11.021
Recommendations
integer programmingcut-generating functionsdual-feasible functions2-slope theoremcomputer-based search
Cites Work
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- Cyclic group and knapsack facets
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- Some polyhedra related to combinatorial problems
- A \((k+1)\)-slope theorem for the \(k\)-dimensional infinite group relaxation
- Equivariant perturbation in Gomory and Johnson's infinite group problem. I: The one-dimensional case
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Minimal inequalities
- A characterization of minimal valid inequalities for mixed integer programs
- Minimal inequalities for mixed integer programs
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- The power of pyramid decomposition in Normaliz
- Cut-generating functions for integer variables
- Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond
- Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case
- Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions
- On perturbation spaces of minimal valid functions: inverse semigroup theory and equivariant decomposition theorem
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
Cited In (8)
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Title not available (Why is that?)
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- On the extremality of maximal dual feasible functions
- Characterization and approximation of strong general dual feasible functions
- A survey of dual-feasible and superadditive functions
- Superadditive characterizations of pure integer programming feasibility
- Structure and interpretation of dual-feasible functions
Uses Software
This page was built for publication: Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064286)
