Network Relaxations and Lower Bounds for Multiple Choice Problems

DOI10.1080/03155986.1982.11731875MaRDI QIDQ3967363zbMATH OpenOpenAlexFDO

Authors Fred Glover, John M. Mulvey

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

generalized upper boundinglower boundsmultiple choice constraintsnetwork relaxationsnumerical efficiencypenalty calculations

Mathematics Subject Classification ID

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

Cited in

(2)

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

This page was built for publication: Network Relaxations and Lower Bounds for Multiple Choice Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967363)