Consolidating maintenance spares

Computational Optimization and Applications

Volumn 18, Issue 3, 2001, Pages 251-272

  Mehrotra, Anuj ^a   Natraj, N R ^b   Trick, Michael A ^c  

^a UNIVERSITY OF MIAMI   (United States)

^b Eye Ris Inc   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Branch and price; Clustering; Column generation; Integer programming

Indexed keywords

FAILURE ANALYSIS; FUNCTION EVALUATION; INVENTORY CONTROL; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROBABILITY DISTRIBUTIONS;

NONLINEAR OBJECTIVE FUNCTIONS;

INTEGER PROGRAMMING;

EID: 0035270664     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011285220132     Document Type: Article

References (17)

1. F. Barahona and R. Majhoub, "On the cut polytope," Mathematical Programming, vol. 36, pp. 157-173, 1986.
2. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, "Branch-and-price: Column generation for huge integer programs," Operations Research, vol. 46, no. 3, pp. 316-329, 1998.
3. S. Chopra and M.R. Rao, "The partition problem," Mathematical Programming, vol. 59, pp. 87-116, 1993.
4. C.E. Ferreira, A. Martin, C.C. De Souza, R. Weismantel, and L.A. Wolsey, "Formulations and valid inequalities for the node capacitated graph partitioning problem," Mathematical Programming, vol. 74, pp. 247-266, 1996.
5. C.E. Ferreira, A. Martin, C.C. De Souza, R. Weismantel, and L.A. Wolsey, "The node capacitated graph partitioning problem: A computational study," Mathematical Programming, Series B, vol. 81, pp. 229-256, 1998.
6. M. Grötschel and Y. Wakabayashi, "A cutting plane algorithm for a clustering problem," Mathematical Programming, Series B, vol. 45, pp. 59-96, 1989.
7. M. Grötschel and Y. Wakabayashi, "Facets of the clique partitioning polytope," Mathematical Programming, vol. 47, pp. 367-387, 1990.
8. E.L. Johnson, "Modeling and strong linear programs for mixed integer programming," in Algorithms and Model Formulations in Mathematical Programming, S.W. Wallace (Ed.), NATO ASI Series 51, 1989.
9. E.L. Johnson, A. Mehrotra, and G.L. Nemhauser, "Min-cut clustering," Mathematical Programming, vol. 62, pp. 133-151, 1993.
10. A. Mehrotra and M.A. Trick, "A column generation approach for graph coloring," INFORMS Journal on Computing, vol. 8, pp. 344-354, 1996.
11. A. Mehrotra and M.A. Trick, "Cliques and clustering: A combinatorial approach," Operations Research Letters, vol. 22, no. 1, pp. 1-12, 1997.
12. G.L. Nemhauser, M.W.P. Savelsbergh, and G.C. Sigismondi, "Minto, a mixed integer optimizer," Operations Research Letters, vol. 15, pp. 47-58, 1994.
13. J.C. Picard and H.D. Ratliff, "Minimum cuts and related problems," Networks, vol. 5, pp. 394-422, 1975.
14. J.M.W. Rhys, "A selection problem of shared fixed costs and network flows," Management Science, vol. 17, pp. 200-207, 1970.
15. D.M. Ryan and B.A. Foster, "An integer programming approach to scheduling," in Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, A. Wren (Ed.), North Holland, Amsterdam, 1981, pp. 269-280.
16. M.W.P. Savelsbergh, "A branch-and-price algorithm for the generalized assignment problem," Operations Research, vol. 45, no. 6, pp. 831-841, 1997.
17. P.H. Vance, C. Barnhart, E.L. Johnson, and G.L. Nemhauser, "Solving binary cutting stock problems by column generation and branch-and-bound," Computational Optimization and Applications, vol. III, pp. 111-130, 1993.