Designing satellite communication networks by zero—one quadratic programming

DOI10.1002/net.3230190404zbMath0669.90075MaRDI QIDQ3823407

Thomas L. Magnanti, Marcia P. Helme

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190404

zbMATH Keywords

design; branch and bound; near-optimal solutions; homing stations; satellite communication networks; zero-one quadratic facility location

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

90C20: Quadratic programming

90B10: Deterministic network models in operations research

90C09: Boolean programming

Related Items

Unnamed Item, Optimal design of a distributed network with a two-level hierarchical structure, A linear program for the two-hub location problem, Integer programming formulations of discrete hub location problems, A cost allocation problem arising in hub-spoke network systems, Topological design of a two-level network with ring-star configuration, An improved linearization strategy for zero-one quadratic programming problems, Star \(p\)-hub median problem with modular arc capacities

Cites Work

• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• A branch‐bound algorithm for the capacitated facilities location problem
• Unnamed Item
• Unnamed Item