A class of hard small 0-1 programs

DOI10.1007/3-540-69346-7_22MaRDI QIDQ3840366zbMATH OpenFDO

Authors Gérard Cornuéjols, Milind Dawande

Publication date 19 April 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69346-7_22

zbMATH Keywords

0-1 programsbasis reduction algorithms

Mathematics Subject Classification ID

Boolean programming (90C09) Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Solving Large-Scale Zero-One Linear Programming Problems
• Efficient reformulation for 0-1 programs -- methods and computational results
• Improved sorting-based procedure for integer programming

Cited in

(10)

• Thinner is not always better: cascade knapsack problems
• Exact algorithms for the equitable traveling salesman problem
• Experiments with conflict analysis in mixed integer programming
• A fixed point iterative approach to integer programming and its distributed computation
• Tractability-preserving transformations of global cost functions
• Approximation algorithms for discrete polynomial optimization
• Zero-One Designs Produce Small Hard SAT Instances
• Non-standard approaches to integer programming
• Integer-programming software systems
• Intermediate integer programming representations using value disjunctions

This page was built for publication: A class of hard small 0-1 programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840366)