An outer approximate subdifferential method for piecewise affine optimization

Mathematical Programming, Series B

Volumn 87, Issue 1, 2000, Pages 57-86

  Neame, Philip ^a   Boland, Natashia ^b   Ralph, Daniel ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Approximate subdifferential; Bundle method; Lagrangian dual; Piecewise affine functions; Uncapacitated facility location

Indexed keywords

EID: 26444474149     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101079900112     Document Type: Article

References (22)

1. Balas, E., Carrera, M.C. (1996): A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44, 875-890
2. Ball, M.O., Derigs, U., Hilbrand, C., Metz, A. (1990): Matching problems with generalized upper bound side constraints. Networks 20, 703-721
3. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, RH. (1998): Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46, 316-329
4. Barnhart, C., Boland, N.L., Clarke, L.W., Johnson, E.L., Nemhauser, G.L., Shenoi, R.G. (1998): Right string models for aircraft fleeting and routing. Transp. Sci. 32, 208-220
5. Conn, A.R., Cornuéjols, G. (1990): A projection method for the uncapacitated facility location problem. Math. Program. 46, 703-721
6. Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A. (1989): The Uncapacitated Facility Location Problem. In: Francis, R.L., Mirchandani, P., eds., Discrete Location Theory. Wiley, New York
7. Desrochers, M., Soumis, F. (1989): A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23, 1-13
8. Desrochers, M., Desrosiers, J., Solomon, M. (1992): A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342-354
9. Erlenkotter, D. (1978): A dual-based procedure for uncapacitated facility location. Oper. Res. 26, 992-1009
10. Held, M., Karp, R.M. (1970): The travelling salesman problem and minimal spanning trees. Oper. Res. 18, 1138-1162
11. Hiriart-Urruty, J.B., Lemaréchal, C. (1993): Convex Analysis and Minimization Algorithms. Springer, Berlin
12. Karg, R.L., Thompson, G.L. (1964): A heuristic approach to solving travelling salesman problems. Manage. Sci. 10, 225-248
13. Kelley, J.E. (1960): The cutting plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703-712
14. Kiwiel, K.C. (1985): Methods of Descent for Nondifferentiable Optimization. Springer, Berlin
15. Kohl, N., Madsen, O.B.G. (1997): An optimization algorithm for the vehicle routing problem with time windows based on lagrangean relaxation. Oper. Res. 45, 395-406
16. Krolak, P., Felts, W., Marble, G. (1971): A man-machine approach towards solving the travelling salesman problem. Commun. ACM 14, 327-334
17. Lavoie, S., Minoux, M., Odier, E. (1988): A new approach for crew pairing problems by column generation with an application to air transportation. Eur. J. Oper. Res. 35, 45-58
18. Lee, K., Park, K., Park, S. (1996): Design of capacitated networks with tree configurations. Telecommunication Systems 6, 1-19
19. Nemhauser, G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. Wiley, New York
20. Schramm, H., Zowe, J. (1992): A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2, 121-152
21. Shor, N.Z. (1985): Minimization Methods for Nondifferentiable Functions. Springer, Berlin
22. Vanderbei, R.J.: LOQO User's Manual - Version 3.10. Technical Report SOR-97-08, Princeton University