scientific article

zbMATH Open0910.90220MaRDI QIDQ3840366FDOQ3840366

Gérard Cornuéjols, Milind Dawande

Publication date: 19 April 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

basis reduction algorithms0-1 programs

Mathematics Subject Classification ID

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

Cited In (10)

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

   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 👍 👎

This page was built for publication:

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