The optimal diversity management problem

Operations Research

Volumn 52, Issue 4, 2004, Pages

  Briant, Olivier ^a   Naddef, Denis ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

Author keywords

Large scale integer programming and relaxations: Lagrangean relaxation of a large linear integer program arising from an application; Production planning: choice of production

Indexed keywords

COSTS; LINEAR PROGRAMMING; PROBLEM SOLVING; PRODUCTION CONTROL; RELAXATION PROCESSES; STRATEGIC PLANNING;

CHOICE OF PRODUCTION; LARGE-SCALE INTEGER PROGRAMMING AND RELAXATIONS; OPTIMAL DIVERSITY MANAGEMENT PROBLEM (ODMP); PRODUCTION PLANNING;

INTEGER PROGRAMMING;

EID: 19444366732     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0108     Document Type: Article

References (19)

1. Andersen, E. D., K. D. Andersen. 1995. Presolving in linear programming. Math. Programming 71 221-245.
2. Avella, P., A. Sassano, I. Vasiliev. 2003. Computational study of large-scale p-median problems. Technical report 08-03 DIS - Universita di Roma "La Sapienza," Rome, Italy.
3. Beasley, J. E. 1987. An algorithm for set covering problems. Ear. J. Oper. Res. 31 85-93.
4. Beasley, J. E. 1993a. Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(4) 383-399.
5. Beasley, J. E. 1993b. Lagrangean relaxation. C. Reeves, ed. Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, U.K., 243-303.
6. Briant, O. 2000. Etude théorique et numérique du problème de la gestion de la diversité. Ph.D. thesis, INP Grenoble, France, ftp://ftp.imag.fr/ pub/bibliotheque/theses/2000/Briant. Olivier/.
7. Caprara, A., M. Fischetti, P. Toth. 1996. A heuristic algorithm for the set covering problem. IPCO: 5th Integer Programming and Combin. Optim. Conf., Vancouver, British Columbia, Canada.
8. Ceria., S., P. Nobilli, A. Sassano. 1998. A Lagrangian-based heuristic for large-scale set covering problems. Math. Programming 81 215-228.
9. Crowder, H., E. Johnson, M. W. Padberg. 1983. Solving large-scale zero-one linear programming problems. Oper. Res. 31 803-834.
10. Geoffrion, A. M. 1974. Lagrangean relaxation for integer programming. Math. Programming Stud. 2 82-114.
11. Hiriart-Urruty, J., C. Lemaréchal. 1993. Convex Analysis and Minimization Algorithms II. Springer, Berlin, Heidelberg, Germany.
12. Huffman, K. L., M. W. Padberg. 1991. Improved LP-representations of zero-one linear programs for branch-and-eut. ORSA J. Comput. 3 121-134.
13. Leraaréchal, C., C. Sagastizábal. 1997. Variable metric bundle methods: From conceptual to implementable forms. Math. Programming 76(3) 393-4-10.
14. Martin, A. 1998. Integer Programs with Block Structure. Technische Universität Berlin, Habilitations-Schrift, Berlin, Germany.
15. Martin, A. 2001. General Mixed Integer Programming. Springer Lecture Notes, LNCS2241. Springer, Berlin, Germany.
16. Mulvey, J., H. Crowder. 1979. Cluster analysis: An application of Lagrangian relaxation. Management Sci. 25(4) 329-340.
17. Nemhauser, G., L. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley-Interscience, New York.
18. Suhl, U. H., R. Szymanski. 1994. Supernode processing of mixed-integer models. Comput. Optim. Appl. 3 317-331.
19. Thonemann, U. W., M. L. Brandeau. 2000. Optimal commonality in component design. Oper. Res. 48 1-19.