Upper bounds on the number of solutions of binary integer programs

DOI10.1007/978-3-642-13520-0_24MaRDI QIDQ3569931zbMATH OpenOpenAlexFDO

Authors Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13520-0_24

zbMATH Keywords

CP-based Lagrangian relaxationdynamic programmingsolution countingsurrogate relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 6007902
• Dual network bounds for integer programming problems of a special form
• Counting Solutions of Knapsack Constraints
• On the number of solutions generated by the simplex method for LP
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection

Cited in

(2)

• scientific article; zbMATH DE number 609981 (Why is no real title available?)
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection

This page was built for publication: Upper bounds on the number of solutions of binary integer programs

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