Pages that link to "Item:Q1428041"
From MaRDI portal
The following pages link to The multidimensional 0-1 knapsack problem: an overview. (Q1428041):
Displaying 38 items.
- Resource allocation based on redundancy models for high availability cloud (Q2218493) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Some new results on multi-dimension Knapsack problem (Q2386611) (← links)
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem (Q2427438) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
- Allocation of advertising space by a web service provider using combinatorial auctions (Q2571440) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- The multidimensional knapsack problem: structure and algorithms (Q2899058) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application (Q2954352) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Intelligent water drops algorithm (Q3526263) (← links)
- Modeling multiple plant sourcing decisions (Q3532786) (← links)
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum (Q4201825) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
- A multidimensional knapsack model for asset-backed securitization (Q4656688) (← links)
- Placement Optimization in Refugee Resettlement (Q5031637) (← links)
- 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<sup>®</sup> (Q5059432) (← links)
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem (Q5438265) (← links)
- The basic train makeup problem in shunting yards (Q5964852) (← links)
- A deep real options policy for sequential service region design and timing (Q6065667) (← links)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
- An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem (Q6588464) (← links)
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)