EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 27 / No 2 (1993) RAIRO-Oper. Res., 27 2 (1993) 169-187 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 27, Number 2, 1993
Page(s) 169 - 187
DOI https://doi.org/10.1051/ro/1993270201691
Published online 06 February 2017
  • [BOPL91] P. BOURGEOIS and G. PLATEAU, BPK90 : A Revisited Hybrid Algorithm for the 0-1 Knapsack Problem, Publication LIPN, 1991, n° 91-2.Université Paris-Nord. [Google Scholar]
  • [DYE80] H. E. DYER, Calculating Surrogate Constraints, Mathematical Programming 19, 1980, p. 255-278. [MR: 589258] [Zbl: 0464.90067] [Google Scholar]
  • [FAPL82] D. FAYARD and G. PLATEAU, An Algorithm for the Solution of the 0-1 Knapsack Problem, Compting, 1982, 28, p. 269-287. [Zbl: 0468.90045] [Google Scholar]
  • [FAPL92] D. FAYARD and G. PLATEAU, An Exact Algorithm for the 0-1 Collapsing Knapsack Problem. Proceedings de la conférence "Viewpoints on Optimization", Grimentz, Suisse, Août 1990, à paraître dans Discrete Applied Mathematics. [Zbl: 0806.90089] [Google Scholar]
  • [FLP90] A. FRÉVILLE, L. A. N. LORENA and G. PLATEAU, A Monotone Decreasing Algorithm for Solving the Surrogate Dual of 0-1 Multiknapsack Problems, Publication LIPN, 1990, n° 90-13, Université Paris-Nord. [Google Scholar]
  • [FRE91] A. FRÉVILLE, Contribution à l'optimisation en nombres entiers, Thèse d'habilitation à diriger des recherches, Université Paris-Nord, 1991. [Google Scholar]
  • [FRPL86] A. FRÉVILLE and G. PLATEAU, Heuristics and Reduction Methods for Multiple Constraints 0-1 Linear Programming Problems, European Journal of Operational Research, 1986, 24, p. 206-215. [MR: 827232] [Zbl: 0579.90066] [Google Scholar]
  • [FRPL90] A. FRÉVILLE and G. PLATEAU, Hard 0-1 Multiknapsack Test Problems for Size Reduction Methods, Investigation Operativa 1, 1990, p. 251-270. [Google Scholar]
  • [FRPL92a] A. FRÉVILLE and G. PLATEAU, An Efficient Preprocessing Procedure for the Solution of the 0-1 Multiknapsack Problem, Proceedings de la conférence "Viewpoints on Optirnization", Grimentz, Suisse, août 1990, à paraître dans Discrete Applied Mathematics. [Zbl: 0802.90077] [Google Scholar]
  • [FRPL92b] A. FRÉVILLE and G. PLATEAU, FPBK92 : An Implicit Enumeration Code for the Solution of the 0-1 Bidimensional Knapsack Problem Based on Surrogate Duality, Graphs and Optimization Colloquium, Grimentz, Suisse, août 1992. [Zbl: 0782.90069] [Google Scholar]
  • [FRPL93] A. FRÉVILLE and G. PLATEAU, SADE2 : An Exact Algorithm for Solving the Biknapsack Surrogate Dual, à paraître dans European Journal of Operational Research, 66, 1993. [Google Scholar]
  • [GAPI85] B. GAVISH and H. PIRKUL, Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality, Mathematical Programming, 1985, 31, p. 78-105. [MR: 787388] [Zbl: 0571.90065] [Google Scholar]
  • [GLO65] F. GLOVER, A Multiphase Dual Algorithm for the Zero-One Integer Programming Problem Operations Research, 1965, 13 (6), p. 879-919. [Zbl: 0163.41301] [Google Scholar]
  • [MAMA57] A. S MANNE and H. M. MARKOWITZ, On the Solution of Discrete Programming Problems, Econometrica, 1957, 25, p. 84-110. [MR: 85968] [Zbl: 0078.34005] [Google Scholar]
  • [MATO92] S. MARTELLO and P. TOTH, Exact Solution of Hard Knapsack Problems, EURO XII-TIMS XXXI, Helsinki, Finlande, juin 1992. [Google Scholar]
  • [PET67] C. C. PETERSEN, Computational Experience With Variants of the Balas Algorithm Applied to the Selection for R & D Projects, Management Science, 1967, 13 (9), p. 736-750. [Google Scholar]
  • [SETO68] S. SENJU and Y. TOYODA, An Approach to Linear Programming with 0-1 Variables, Management Science, 1968, 15 (4), p. 196-205. [Google Scholar]
  • [WENE67] H. M. WEINGARTNER and D. N. NESS, Method for the Solution of the Multidimensional 0-1 Knapsack Problem, Operations Research, 1967, 15 (1), p. 83-103. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.