Compact representation of near-optimal integer programming solutions

DOI10.1007/s10107-019-01390-3zbMath1445.90061OpenAlexW2939146203WikidataQ128084320 ScholiaQ128084320MaRDI QIDQ2191768

Thiago Serra, John N. Hooker

Publication date: 26 June 2020

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-019-01390-3

zbMATH Keywords

integer programmingdecision diagramspostoptimality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Compact representations of all members of an independence system
• Approximating the stability region for binary mixed-integer programs
• Experiments concerning sequential versus simultaneous maximization of objective function and distance
• A new dominance procedure for combinatorial optimization problems
• On the complexity of postoptimality analysis of \(0/1\) programs
• Size of ordered binary decision diagrams representing threshold functions
• Discrete Optimization with Decision Diagrams
• Pruning Moves
• Three methods for postoptimal analysis in integer linear programming
• On Threshold BDDs and the Optimal Variable Ordering Problem
• Sensitivity Analysis for Branch and Bound Integer Programming
• Graph-Based Algorithms for Boolean Function Manipulation
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Binary Decision Diagrams
• Improving the variable ordering of OBDDs is NP-complete
• Branching Programs and Binary Decision Diagrams
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
• Generating Multiple Solutions for Mixed Integer Programming Problems

This page was built for publication: Compact representation of near-optimal integer programming solutions