Suchergebnisse - (integer OR interier) programming 0-1 multidimensional knapsack problem

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 von Lu, Yun, Vasko, Francis J.

“… This paper provides comprehensive empirical and analytical evidence of the impact of choice constraints on two important categories of knapsack problems by using the integer programming option of CPLEX …”
Volltext

Heuristics for the 0–1 multidimensional knapsack problem von Boyer, V., Elkihel, M., El Baz, D.

“… Two heuristics for the 0–1 multidimensional knapsack problem (MKP) are presented. The first one uses surrogate relaxation, and the relaxed problem is solved via a modified dynamic-programming algorithm …”
Volltext

Improved convergent heuristics for the 0-1 multidimensional knapsack problem von Hanafi, Saïd, Wilbaut, Christophe

“… This process is suitable for the 0-1 mixed integer programming problems when the number of constraints is relatively smaller when compared to the number of variables …”
Volltext

A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem von Balev, Stefan, Yanev, Nicola, Fréville, Arnaud, Andonov, Rumen

“… This paper presents a preprocessing procedure for the 0–1 multidimensional knapsack problem …”
Volltext

Problem reduction heuristic for the 0–1 multidimensional knapsack problem von Hill, Raymond R., Kun Cho, Yong, Moore, James T.

“… This paper introduces new problem-size reduction heuristics for the multidimensional knapsack problem …”
Volltext

New convergent heuristics for 0–1 mixed integer programming von Wilbaut, Christophe, Hanafi, Said

“… Several hybrid methods have recently been proposed for solving 0–1 mixed integer programming problems …”
Volltext

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects von Fréville, Arnaud, Hanafi, SaÏd

“… The multidimensional 0-1 knapsack problem (MKP) is a resource allocation model that is one of the most well-known integer programming problems …”
Volltext

Solving multidimensional 0–1 knapsack problem by P systems with input and active membranes von Pan, Linqiang, Martín-Vide, Carlos

“… In this paper, we present a membrane algorithm to solve multidimensional 0–1 knapsack problem in linear time by recognizer P systems with input and with active membranes using 2-division …”
Volltext

A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem von Yoon, Yourim, Kim, Yong-Hyuk, Moon, Byung-Ro

“… capacity suitable to the 0-1 multidimensional knapsack problem and present its new geometric equivalent condition including a new associated property …”
Volltext

Local and global lifted cover inequalities for the 0–1 multidimensional knapsack problem von Kaparis, Konstantinos, Letchford, Adam N.

“… The 0–1 multidimensional knapsack problem (0–1 MKP) is a well-known (and strongly NP -hard …”
Volltext

A binary particle swarm optimization based on the surrogate information with proportional acceleration coefficients for the 0-1 multidimensional knapsack problem von Lin, Chin-Jung, Chern, Maw-Sheng, Chih, Mingchang

“… The 0-1 multidimensional knapsack problem (MKP) has been proven it belongs to difficult NP-hard combinatorial optimization problems …”
Volltext

Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem von Xu, Jitao, Li, Hongbo, Yin, Minghao

“… The 0-1 Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem with many engineering applications …”
Volltext

An FW–GA Hybrid Algorithm Combined with Clustering for UAV Forest Fire Reconnaissance Task Assignment von Liu, Xinlin, Jing, Tian, Hou, Linyi

“… ) clustering and the multidimensional knapsack model (MKP) is proposed for the forest fire reconnaissance task assignment …”
Volltext

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem von Hanafi, Saïd, Lazić, Jasmina, Mladenović, Nenad, Wilbaut, Christophe, Crévits, Igor

“… In this paper we propose new hybrid heuristics for the 0-1 mixed integer programming problem, based on the variable neighbourhood decomposition search principle and on exploiting information obtained …”
Volltext

A DIMMA-Based Memetic Algorithm for 0-1 Multidimensional Knapsack Problem Using DOE Approach for Parameter Tuning von Yaghini, Masoud, Momeni, Mohsen, Sarmadi, Mohammadreza

“… Multidimensional 0-1 Knapsack Problem (MKP) is a well-known integer programming problems …”
Volltext

Tightening concise linear reformulations of 0-1 cubic programs von Forrester, Richard J.

“… A common strategy for solving 0-1 cubic programs is to reformulate the non-linear problem into an equivalent linear representation, which can then be submitted directly to a standard mixed-integer programming solver …”
Volltext

Solving multidimensional 0-1 knapsack problem by Psystems with input and active membranes von LINQIANG PAN, MARTIN-VIDE, Carlos

Volltext

When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners von Song, Myung Soon, Emerick, Brooks, Lu, Yun, Vasko, Francis J.

“… An important generalization of the classic 0-1 knapsack problem is the multi-demand multidimensional knapsack problem (MDMKP …”
Volltext

Model and algorithms for multi-period sea cargo mix problem von Ang, James S.K., Cao, Chengxuan, Ye, Heng-Qing

“… We describe the characteristics of the cargo mix problem for the carrier in a multi-period planning horizon, and formulate it as a multi-dimensional multiple knapsack problem (MDMKP …”
Volltext

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem von Crévits, Igor, Hanafi, Saïd, Mansi, Raïd, Wilbaut, Christophe

“… In this paper, we propose new iterative relaxation-based heuristics for the 0–1 Mixed Integer Programming problem (0–1 MIP …”
Volltext