ON THE DIETRICH-ESCUDERO APPROACH FOR SOLVING THE 0-1 KNAPSACK-PROBLEM WITH A 0-1 OBJECTIVE FUNCTION

被引:2
|
作者
ESCUDERO, LF
PEREZ, G
GARIN, A
机构
[1] UNIV MADRID,MADRID 3,SPAIN
[2] UNIV BASQUE COUNTRY,LEJONA,SPAIN
关键词
MIXED; 0-1; MODELS; KNAPSACK; LP RELAXATION;
D O I
10.1016/0377-2217(94)90156-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this brief note we demonstrate that the Dietrich-Escudero procedure for solving the 0-1 knapsack problem with all 0-1 objective function coefficients is precisely an application of the Dantzig algorithm for solving the 0-1 LP knapsack problem plus an appropriate rounding of the solution.
引用
收藏
页码:167 / 168
页数:2
相关论文
共 50 条
  • [31] A new exact approach for the 0-1 Collapsing Knapsack Problem
    Della Croce, Federico
    Salassa, Fabio
    Scatamacchia, Rosario
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (01) : 56 - 69
  • [32] Solving 0-1 Knapsack Problem using Cohort Intelligence Algorithm
    Kulkarni, Anand J.
    Shabir, Hinna
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2016, 7 (03) : 427 - 441
  • [33] A study Report on Solving 0-1 Knapsack Problem with Imprecise Data
    Padmanabhan, Jayashree
    Swagath, S.
    2017 INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND INFORMATICS (ICCCI), 2017,
  • [34] Solving 0-1 knapsack problem by greedy degree and expectation efficiency
    Lv, Jianhui
    Wang, Xingwei
    Huang, Min
    Cheng, Hui
    Li, Fuliang
    APPLIED SOFT COMPUTING, 2016, 41 : 94 - 103
  • [35] A probabilistic solution discovery algorithm for solving 0-1 knapsack problem
    Hu, Fangxia
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2018, 33 (06) : 618 - 626
  • [36] New binary bat algorithm for solving 0-1 knapsack problem
    Rizk-Allah, Rizk M.
    Hassanien, Aboul Ella
    COMPLEX & INTELLIGENT SYSTEMS, 2018, 4 (01) : 31 - 53
  • [37] Solving 0-1 knapsack problem by binary flower pollination algorithm
    Abdel-Basset, Mohamed
    El-Shahat, Doaa
    El-Henawy, Ibrahim
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (09): : 5477 - 5495
  • [38] Exact algorithm for bi-objective 0-1 knapsack problem
    Jolai, Fariborz
    Rezaee, M. J.
    Rabbani, M.
    Razmi, J.
    Fattahi, Pariviz
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 194 (02) : 544 - 551
  • [39] On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems
    Qiu, Yang
    Li, Haomiao
    Wang, Xiao
    Dib, Omar
    PAAP 2021: 2021 12TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING, 2021, : 56 - 61
  • [40] THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM A New Heuristic Algorithm Combined with 0-1 Linear Programming
    Csebfalvi, Aniko
    Csebfalvi, Gyorgy
    ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011, : 203 - 207