Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks

DOI10.1287/opre.28.3.829zbMath0443.90064OpenAlexW2017155363MaRDI QIDQ3887226

Fred Glover, John M. Mulvey

Publication date: 1980

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.28.3.829

zbMATH Keywords

relaxationsgeneralized networkspure networksequivalent problem formulationmixed integer generalized network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Related Items

A Lagrangean decomposition solution to a single line multiproduct scheduling problem ⋮ Layering strategies for creating exploitable structure in linear and integer programs ⋮ Graph theoretic relaxations of set covering and set partitioning problems ⋮ Lagrangean decomposition: A model yielding stronger lagrangean bounds ⋮ An evaluation of mathematical programming and minicomputers ⋮ An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Fuzzy multicriteria integer programming via fuzzy generalized networks ⋮ A tool for network modeling