Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

DOI10.1016/S0305-0548(00)00104-0zbMath0994.90106MaRDI QIDQ1603339

Dennis L. Bricker, Edward Yu-Hsien Lin

Publication date: 11 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (2)

Incremental and encoding formulations for mixed integer programming ⋮ Mixed Integer Linear Programming Formulation Techniques

Uses Software

• APL2

Cites Work

• Unnamed Item
• On the calculation of true and pseudo penalties in multiple choice integer programming
• Computational comparison on the partitioning strategies in multiple choice integer programming
• A note on modeling multiple choice requirements for simple mixed integer programming solvers
• Improved penalty calculations for a mixed integer branch-and-bound algorithm
• Multiple choice programming: A state-of-the-art review

This page was built for publication: Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming