- Title
- Canonical duality theory and algorithm for solving challenging problems in network optimisation
- Creator
- Ruan, Ning; Gao, David
- Date
- 2012
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/55683
- Identifier
- vital:4871
- Identifier
-
https://doi.org/10.1007/978-3-642-34487-9_85
- Identifier
- ISBN:03029743 (ISSN); 9783642344862 (ISBN)
- Abstract
- This paper presents a canonical dual approach for solving a general nonconvex problem in network optimization. Three challenging problems, sensor network location, traveling salesman problem, and scheduling problem are listed to illustrate the applications of the proposed method. It is shown that by the canonical duality, these nonconvex and integer optimization problems are equivalent to unified concave maximization problem over a convex set and hence can be solved efficiently by existing optimization techniques. © 2012 Springer-Verlag.
- Publisher
- Doha Springer Berlin Heidelberg
- Relation
- 19th International Conference on Neural Information Processing, ICONIP 2012 Vol. 7665 LNCS, p. 702-709
- Rights
- Copyright 2012 Springer-Verlag
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Canonical duality theories; Convex set; Dual approach; Integer optimization; Maximization problem; Network location; Network optimisation; Network optimization; Nonconvex problem; Optimization techniques; Scheduling problem; Data processing; Global optimization; Integer programming; Scheduling; Sensor networks; Set theory; Traveling salesman problem; Wireless networks; Problem solving
- Full Text
- Reviewed
- Hits: 4995
- Visitors: 5396
- Downloads: 539
Thumbnail | File | Description | Size | Format | |||
---|---|---|---|---|---|---|---|
View Details Download | SOURCE1 | Accepted version | 214 KB | Adobe Acrobat PDF | View Details Download | ||
View Details Download | SOURCE2 | Published Version | 386 KB | Adobe Acrobat PDF | View Details Download |