Optimal design of a distributed network with a two-level hierarchical structure
DOI10.1016/0377-2217(92)90181-8zbMath0758.90072OpenAlexW2158189542MaRDI QIDQ1203810
Sung-hark Chung, Dong-wan Tcha, Young-Soo Myung
Publication date: 18 February 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90181-8
quadratic 0-1 programmingdual-based algorithmtopological design of a networktwo-level hierarchical structure
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Hierarchical systems (93A13) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (14)
Cites Work
- Efficient algorithms for the capacitated concentrator location problem
- A quadratic integer program for the location of interacting hub facilities
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Designing satellite communication networks by zero—one quadratic programming
- Analysis of a flow problem with fixed charges
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Topological design of centralized computer networks—formulations and algorithms
- Large-Scale Network Topological Optimization
This page was built for publication: Optimal design of a distributed network with a two-level hierarchical structure