On solving the progressive party problem as a MIP.

DOI10.1016/S0305-0548(02)00101-6zbMath1088.90040MaRDI QIDQ1422363

Erwin Kalvelagen

Publication date: 14 February 2004

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

zbMATH Keywords

ModelingMixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

Unnamed Item ⋮ Optimization methods for pipeline transportation of natural gas with variable specific gravity and compressibility ⋮ A combined CLP-MILP approach for scheduling commodities in a pipeline ⋮ Multicriteria models for planning power-networking events

Uses Software

• WSAT(OIP)

Cites Work

• Unnamed Item
• A new approach to integrating mixed integer programming and constraint logic programming
• Integer optimization by local search. A domain-independent approach
• Mixed logical-linear programming
• Organizing a social event --- A difficult problem of combinatorial optimization
• Program development by stepwise refinement

This page was built for publication: On solving the progressive party problem as a MIP.