Search Results - (integer OR interier) programming 0-1 multidimensional knapsack problems

A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^®.

Authors: Lu, Yun Vasko, Francis J.

Source: Engineering Optimization. Sep2020, Vol. 52 Issue 9, p1632-1644. 13p.

Subject Terms: *KNAPSACK problems, *INTEGER programming, *GENERALIZATION, *OPERATIONS research, *LINEAR programming, *MOTIVATION (Psychology)

When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners.

Authors: Song, Myung Soon Emerick, Brooks Lu, Yun et al.

Source: Engineering Optimization. May2022, Vol. 54 Issue 5, p894-906. 13p.

Subject Terms: *KNAPSACK problems, *INTEGER programming, *OPERATIONS research, *PERSONAL computer software, *BACKPACKS, *COMPUTER software, *PROBLEM solving

An Improved Heuristic for Multidimensional 0-1 Knapsack Problems

Authors: Volgenant, A. Zoon, J. A.

Source: The Journal of the Operational Research Society, 1990 Oct 01. 41(10), 963-970.

Access URL: https://www.jstor.org/stable/2583274

Improved convergent heuristics for the 0-1 multidimensional knapsack problem.

Authors: Hanafi, Saïd Wilbaut, Christophe

Source: Annals of Operations Research. Mar2011, Vol. 183 Issue 1, p125-142. 18p.

Subject Terms: *HEURISTIC algorithms, *KNAPSACK problems, *LINEAR programming, *INTEGER programming, *STOCHASTIC convergence

Greedy algorithm for the general multidimensional knapsack problem.

Authors: Akçay, Yalçın Haijun Li Xu, Susan H.

Source: Annals of Operations Research. Mar2007, Vol. 150 Issue 1, p17-29. 13p. 12 Charts.

Subject Terms: *INTEGER programming, *MATHEMATICAL programming, *KNAPSACK problems, *HEURISTIC, *MATHEMATICAL variables

A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem.

Authors: Cappanera, Paola Trubian, Marco

Source: INFORMS Journal on Computing. Winter2005, Vol. 17 Issue 1, p82-98. 17p.

Subject Terms: *INTEGER programming, *HEURISTIC programming, *KNAPSACK problems, *CONSTRAINT satisfaction, *ARTIFICIAL intelligence, *MATHEMATICAL programming

Bilim merkezlerine düzenek seçimi için çok amaçlı çok boyutlu bir sırt çantası modeli.

Alternate Title: A Multiobjective multidimensional knapsack model for exhibition selection for science centers.

Authors: Hülagü, Kemal Taha Fığlalı, Alpaslan

Source: Journal of the Faculty of Engineering & Architecture of Gazi University / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi,. 2025, Vol. 40 Issue 1, p165-177. 13p.

Subject Terms: *SCIENCE exhibitions, *OPERATING budgets, *INTEGER programming, *VISITORS' centers, *BUDGET, *KNAPSACK problems, *MATHEMATICAL programming

Improvement of genetic algorithms with decomposition procedures for large-scale multiobjective multidimensional 0-1 knapsack problems incorporating fuzzy goals.

Authors: Kato, Kosuke Sakawa, Masatoshi Ikegame, Toshinori

Source: Electronics & Communications in Japan, Part 3: Fundamental Electronic Science. Dec2000, Vol. 83 Issue 12, p62-69. 8p.

Subject Terms: *KNAPSACK problems, *INTEGER programming, *BRANCH & bound algorithms, *MATHEMATICAL programming, *GENETIC algorithms

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects.

Authors: Fréville, Arnaud Hanafi, SaÏd

Source: Annals of Operations Research. Oct2005, Vol. 139 Issue 1-4, p195-227. 33p.

Subject Terms: *COMPUTER software development, *KNAPSACK problems, *HEURISTIC programming, *ARTIFICIAL intelligence, *MULTIDISCIPLINARY design optimization, *INTEGER programming, *GENETIC algorithms, *COMPUTER arithmetic

A General Framework for Providing Interval Representations of Pareto Optimal Outcomes for Large-Scale Bi- and Tri-Criteria MIP Problems.

Authors: Filcek, Grzegorz Miroforidis, Janusz

Source: Informatica. 2024, Vol. 35 Issue 2, p255-282. 28p.

Subject Terms: *PARETO optimum, *KNAPSACK problems, *BACKPACKS

A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^®.

Authors: Lu, Yun Vasko, Francis J.

Source: Engineering Optimization; Sep2020, Vol. 52 Issue 9, p1632-1644, 13p

Subject Terms: KNAPSACK problems, INTEGER programming, GENERALIZATION, OPERATIONS research, LINEAR programming, MOTIVATION (Psychology)

Generating bounded solutions for multi-demand multidimensional knapsack problems: a guide for operations research practitioners.

Authors: Dellinger, Anthony Yun Lu Song, Myung Soon et al.

Source: International Journal of Industrial Optimization; 2022, Vol. 3 Issue 1, p1-17, 17p

Subject Terms: KNAPSACK problems, INTEGER programming, ALGORITHMS, COMPUTER programming, CONSTRAINT algorithms

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem

Authors: Hanafi, Saïd Lazić, Jasmina Mladenović, Nenad et al.

Source: Electronic Notes in Discrete Mathematics. Aug2010, Vol. 36, p883-890. 8p.

Subject Terms: Hybrid systems, Mathematical variables, Decomposition method, Integer programming, Heuristic algorithms, Knapsack problems, Problem solving

Synthetic Optimization Problem Generation: Show Us the Correlations!

Authors: Reilly, Charles H.¹ creilly@mail.ucf.edu

Source: INFORMS Journal on Computing. Summer2009, Vol. 21 Issue 3, p458-467. 10p. 6 Charts.

Subject Terms: *CAPITAL budget, *INTEGER programming, *MATHEMATICAL optimization, *COMPUTER programming, *PUBLIC investments

Tightening concise linear reformulations of 0-1 cubic programs.

Authors: Forrester, Richard J.¹

Source: Optimization. Apr2016, Vol. 65 Issue 4, p877-903. 27p.

Subject Terms: *MIXED integer linear programming, *NONLINEAR theories, *QUADRATIC programming, *COMPUTATIONAL complexity, *PROBLEM solving

Genetic Algorithms With Decomposition Procedures for Multidimensional 0-1 Knapsack Problems With Block Angular Structures.

Authors: Kato, Kouske Sakawa, Masatoshi

Source: IEEE Transactions on Systems, Man & Cybernetics: Part B. Jun2003, Vol. 33 Issue 3, p410. 10p. 2 Black and White Photographs, 6 Charts, 9 Graphs.

Subject Terms: *GENETIC algorithms, *KNAPSACK problems, *COMBINATORIAL optimization, *INTEGER programming, *GENETIC programming

Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation

Authors: Bonami, P. Minoux, M.

Source: Discrete Optimization. Dec2005, Vol. 2 Issue 4, p288-307. 20p.

Subject Terms: Integer programming, Dynamic programming, Nonlinear programming, Linear programming

ON THE STRENGTH OF RELAXATIONS OF MULTIDIMENSIONAL KNAPSACK PROBLEMS.

Authors: Crama, Yves Mazzola, Joseph B.

Source: INFOR; Nov94, Vol. 32 Issue 4, p219-225, 7p

Subject Terms: KNAPSACK problems, LAGRANGIAN functions, INTEGER programming

A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem.

Authors: Shahriar, Abu Zafar M. Akbar, M. Mostofa Rahman, M. Sohel et al.

Source: Journal of Supercomputing. Mar2008, Vol. 43 Issue 3, p257-280. 24p. 4 Diagrams, 11 Graphs.

Subject Terms: *MULTIPROCESSORS, *KNAPSACK problems, *ALGORITHMS, *HEURISTIC, *INTEGER programming, *METHODOLOGY

Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions.

Authors: Osorio, María A. Glover, Fred Hammer, Peter

Source: Annals of Operations Research; Nov2002, Vol. 117 Issue 1-4, p71-93, 23p, 7 Charts

Subject Terms: KNAPSACK problems, INTEGER programming, MATHEMATICAL programming, PROBLEM solving, COMPUTER software