Abstract
A sequence is proposed as a solution to the well-known NP-hard problem. The proposed sequence can be constructed in O(n log n) time. The asymptotical optimality of the sequence is established within the framework of probabilistic analysis.
Original language | English |
---|---|
Pages (from-to) | 373-398 |
Number of pages | 26 |
Journal | Naval Research Logistics |
Volume | 46 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Jun 1999 |
ASJC Scopus subject areas
- Modelling and Simulation
- Ocean Engineering
- Management Science and Operations Research