A note on modeling multiple choice requirements for simple mixed integer programming solvers

DOI10.1016/0305-0548(95)00005-7zbMath0868.90086OpenAlexW2017681344MaRDI QIDQ2563892

Włodzimierz Ogryczak

Publication date: 6 January 1997

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

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00005-7

zbMATH Keywords

branch-and-boundmixed integer programmingspecial ordered setspecial ordered inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (4)

Incremental and encoding formulations for mixed integer programming ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Manpower allocation using genetic annealing ⋮ Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementations of special ordered sets in MP software
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• An ideal column algorithm for integer programs with special ordered sets of variables
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• An Allocation Model for Catalog Space Planning
• Computer Codes for Problems of Integer Programming
• Integer Programming Models for Sales Resource Allocation
• Branch and Bound Methods for Multi-Item Scheduling
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Branch and Bound Methods for Mathematical Programming Systems
• Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming
• An Efficient Algorithm for Multi-Item Scheduling
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)

This page was built for publication: A note on modeling multiple choice requirements for simple mixed integer programming solvers