A branch-and-bound algorithm for the linear ordering problem with cumulative costs

European Journal of Operational Research

Volumn 186, Issue 3, 2008, Pages 965-971

  Righini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Branch and bound; Combinatorial optimization; Linear ordering problem

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMMUNICATION SYSTEMS; COST EFFECTIVENESS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING;

CUMULATIVE COSTS; LINEAR ORDERING PROBLEM; OPTIMAL SOLUTION;

BRANCH AND BOUND METHOD;

EID: 35548985447     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.02.044     Document Type: Article

References (8)

1. Benvenuto N., Carnevale G., and Tomasin S. Optimum power control and ordering in SIC receivers for uplink CDMA systems. IEEE International Conference on Communications, ICC 2005 4 (2005) 2333-2337
2. Bertacco, L., Brunetta, L., Fischetti, M., 2004. The linear ordering problem with cumulative costs. Technical report, Department of Information Engineering, University of Padova, October 13, 2004.
3. Duarte, A., Laguna, M., Martì R., 2006. Tabu search for the linear ordering problem with cumulative costs. Technical report, Universidad de Valencia.
4. Grötschel M., Jünger M., and Reinelt G. A cutting plane algorithm for the linear ordering problem. Operations Research 32 (1984) 1195-1220
5. Grötschel M., Jünger M., and Reinelt G. On the acyclic subgraph polytope. Mathematical Programming 33 (1985) 28-42
6. Grötschel M., Jünger M., and Reinelt G. Facets of the linear ordering polytope. Mathematical Programming 33 (1985) 43-60
7. LOLIB. Linear Ordering LIBrary. .
8. Reinelt G. The linear ordering problem: algorithms and applications. Research and Exposition in Mathematics vol. 8 (1985), Heldermann Verlag, Berlin