Pages that link to "Item:Q1148788"
From MaRDI portal
The following pages link to Heuristic algorithms for the multiple knapsack problem (Q1148788):
Displaying 50 items.
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts (Q339606) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Threshold arrangements and the knapsack problem (Q812753) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- A revised bound improvement sequence algorithm (Q1102193) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Random search in the one-dimensional cutting stock problem (Q1278375) (← links)
- Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
- Optimal bounds for the change-making problem (Q1314390) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674) (← links)
- Matroidal relaxations for 0-1 knapsack problems (Q1319682) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Partial cover and complete cover inequalities (Q1331885) (← links)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- Hierarchical resource planning for shipping companies (Q1390195) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- Shared capacity routing problem -- an omni-channel retail study (Q1622824) (← links)
- Value of agreement in decision analysis: concept, measures and application (Q1652193) (← links)
- A hybrid genetic algorithm for satellite image downlink scheduling problem (Q1726978) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Towards the real time solution of strike force asset allocation problems (Q1765539) (← links)
- Configurable offers and winner determination in multi-attribute auctions (Q1887905) (← links)
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem (Q1926951) (← links)
- Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
