A theoretical and computational comparison of “equivalent” mixed-integer formulations

DOI10.1002/nav.3800280109zbMath0453.90068OpenAlexW2017840156MaRDI QIDQ3901305

Robert R. Meyer

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/58064

zbMATH Keywords

computational comparisonvendor selectiontheoretical comparisoncommunications network designeconomy- of-scale functionsequivalent mixed-integer formulationsnonstandard problem formulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Related Items (6)

Representability in mixed integer programming. I: Characterization results ⋮ A simplification for some disjunctive formulations ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Representability of functions

Cites Work

• Global optimization using special ordered sets

This page was built for publication: A theoretical and computational comparison of “equivalent” mixed-integer formulations