Experiments in integer programming
DOI10.1016/0166-218X(80)90053-0zbMath0428.90041OpenAlexW2029859646MaRDI QIDQ1137509
Publication date: 1980
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(80)90053-0
computational studycomparison of algorithmshybrid algorithmcombination of branch-and-boundenumeration and cutting plane techniqueslarge scale zero-one integer programming problemsmixed-integer cuts
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)
Related Items (8)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Discrete Programming by the Filter Method
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming by Implicit Enumeration and Balas’ Method
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experiments in integer programming