The design of exponential neighborhoods -- a primal approach to integer programming.

zbMATH Open1098.90533MaRDI QIDQ5481255FDOQ5481255

Authors: Robert T. Firla 

Publication date: 9 August 2006

Recommendations

• Primal integer programming
• Exponential irreducible neighborhoods for combinatorial optimization problems
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• A primal all-integer algorithm based on irreducible solutions
• Integer Programming: Optimization and Evaluation Are Equivalent

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10) Boolean programming (90C09)

Cited In (4)

• A primal all-integer algorithm based on irreducible solutions
• Exponential irreducible neighborhoods for combinatorial optimization problems
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• Primal integer programming

This page was built for publication: The design of exponential neighborhoods -- a primal approach to integer programming.

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