Network Relaxations and Lower Bounds for Multiple Choice Problems

DOI10.1080/03155986.1982.11731875zbMath0501.90067OpenAlexW2405880920MaRDI QIDQ3967363

John M. Mulvey, Fred Glover

Publication date: 1982

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsnumerical efficiencygeneralized upper boundingmultiple choice constraintspenalty calculationsnetwork relaxations

Mathematics Subject Classification ID

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

Related Items

A modeling/solution approach for optimal deployment of a weapons arsenal ⋮ The design of multiactivity multifacility systems