Stronger formulations of mixed integer linear programs: an example

DOI10.1080/0020739970280507zbMath0894.90115OpenAlexW2001529231WikidataQ126249865 ScholiaQ126249865MaRDI QIDQ4378103

L. G. Proll

Publication date: 7 September 1998

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739970280507

zbMATH Keywords

distance problemfractional values

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Related Items (1)

A fuzzy genetic algorithm for driver scheduling

Cites Work

• Solving Large-Scale Zero-One Linear Programming Problems
• Formulation of integer linear programs: an example
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• The reformulation of two mixed integer programming problems

This page was built for publication: Stronger formulations of mixed integer linear programs: an example