Výsledky vyhľadávania - (integer OR interier) programming 0-1 multidimensional knapsack problem

An Improved Heuristic for Multidimensional 0-1 Knapsack Problems

Autori: Volgenant, A. Zoon, J. A.

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

Prístupová URL adresa: https://www.jstor.org/stable/2583274

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

Autori: Hanafi, Saïd Wilbaut, Christophe

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

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

A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem

Autori: Balev, Stefan Yanev, Nicola Fréville, Arnaud a ďalší

Prispievatelia: Balev, Stefan Yanev, Nicola Fréville, Arnaud a ďalší

Zdroj: European Journal of Operational Research. 186:63-76

Predmety: Variable reduction, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Multidimensional knapsack problem, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Heuristics, Integer programming, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Dynamic programming, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Prístupová URL adresa: https://inria.hal.science/inria-00184771v1
https://doi.org/10.1016/j.ejor.2006.02.058
https://www.sciencedirect.com/science/article/pii/S0377221707001142
https://dblp.uni-trier.de/db/journals/eor/eor186.html#BalevYFA08
https://hal.inria.fr/inria-00184771
https://hal.archives-ouvertes.fr/hal-00445839
https://ideas.repec.org/a/eee/ejores/v186y2008i1p63-76.html
https://econpapers.repec.org/article/eeeejores/v_3a186_3ay_3a2008_3ai_3a1_3ap_3a63-76.htm

Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem

Autori: Moraga, Reinaldo J. DePuy, Gail W. Whitehouse, Gary E.

Zdroj: Computers & Industrial Engineering. Jan2005, Vol. 48 Issue 1, p83-96. 14p.

Predmety: *ALGORITHMS, *INTEGER programming, KNAPSACK problems, ALGEBRA

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

Autori: Cappanera, Paola Trubian, Marco

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

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

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^®.

Autori: Lu, Yun Vasko, Francis J.

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

Predmety: *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.

Autori: Song, Myung Soon Emerick, Brooks Lu, Yun a ďalší

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

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

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.

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

Zdroj: 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.

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

Greedy algorithm for the general multidimensional knapsack problem.

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

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

Predmety: *INTEGER programming, *MATHEMATICAL programming, *KNAPSACK problems, *HEURISTIC, *MATHEMATICAL variables

New convergent heuristics for 0–1 mixed integer programming

Autori: Wilbaut, Christophe Hanafi, Said

Prispievatelia: Wilbaut, Christophe Hanafi, Said

Zdroj: European Journal of Operational Research. 195:62-74

Predmety: Relaxation, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Heuristic, 0-1 Mixed integer programming, 02 engineering and technology, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Multidimensional Knapsack problem

Popis súboru: application/pdf

Prístupová URL adresa: https://uphf.hal.science/hal-03723751v1
https://doi.org/10.1016/j.ejor.2008.01.044
https://uphf.hal.science/hal-03723751v1/document
http://www.sciencedirect.com/science/article/pii/S0377221708001550
https://dblp.uni-trier.de/db/journals/eor/eor195.html#WilbautH09
https://ideas.repec.org/a/eee/ejores/v195y2009i1p62-74.html
https://EconPapers.repec.org/RePEc:eee:ejores:v:195:y:2009:i:1:p:62-74
https://www.sciencedirect.com/science/article/abs/pii/S0377221708001550

Improved results on the 0–1 multidimensional knapsack problem: Improved results on the 0--1 multidimensional knapsack problem

Autori: Yannick Vimont Michel Vasquez

Zdroj: European Journal of Operational Research. 165:70-81

Predmety: Combinatorial optimization, variables fixing, tabu search, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Integer programming, linear programming, Boolean programming, heuristics, 02 engineering and technology, Approximation methods and heuristics in mathematical programming

Popis súboru: application/xml

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

Autori: Hanafi, Saïd Lazić, Jasmina Mladenović, Nenad a ďalší

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

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

Tightening concise linear reformulations of 0-1 cubic programs.

Autori: Forrester, Richard J.¹

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

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

Solving multidimensional 0–1 knapsack problem by P systems with input and active membranes

Autori: Pan, Linqiang Martín-Vide, Carlos

Zdroj: Journal of Parallel & Distributed Computing. Dec2005, Vol. 65 Issue 12, p1578-1584. 7p.

Predmety: *INTEGER programming, *DYNAMIC programming, *LINEAR programming, *COMPUTATIONAL complexity

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

Autori: Kato, Kosuke Sakawa, Masatoshi Ikegame, Toshinori

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

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

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

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

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

Predmety: *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.

Autori: Filcek, Grzegorz Miroforidis, Janusz

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

Predmety: *PARETO optimum, *KNAPSACK problems, *BACKPACKS

Synthetic Optimization Problem Generation: Show Us the Correlations!

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

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

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

A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem

Autori: Yoon, Yourim Kim, Yong-Hyuk Moon, Byung-Ro

Zdroj: European Journal of Operational Research. Apr2012, Vol. 218 Issue 2, p366-376. 11p.

Predmety: *EMPIRICAL research, *INTEGER programming, *HEURISTIC programming, KNAPSACK problems, LAGRANGIAN functions, FUZZY measure theory, COMPARATIVE studies, CONSTRAINT satisfaction

Local and global lifted cover inequalities for the 0–1 multidimensional knapsack problem

Autori: Kaparis, Konstantinos Letchford, Adam N.

Zdroj: European Journal of Operational Research. Apr2008, Vol. 186 Issue 1, p91-103. 13p.

Predmety: *INTEGER programming, *MATHEMATICAL optimization, *NONLINEAR programming, *MATHEMATICAL programming