The following pages link to (Q3993418):
Displaying 50 items.
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems (Q1278859) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- A lexicographic approach to bi-objective loading of a flexible assembly system (Q1296131) (← links)
- A decision support system for urban waste management (Q1296661) (← links)
- Integrated defect detection and optimization for cross cutting of wooden boards (Q1296782) (← links)
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
- Forward-reserve allocation in a warehouse with unit-load replenishments (Q1303745) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- A branch-and-bound algorithm for the two-dimensional vector packing problem (Q1317086) (← links)
- A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
- Solving the 0-1 proportional knapsack problem by sampling (Q1321464) (← links)
- Reducing the number of variables in integer and linear programming problems (Q1326508) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- A computational note on the Martello-Toth knapsack algorithm (Q1328611) (← links)
- A robust heuristic for the generalized assignment problem (Q1339150) (← links)
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- A branch-and-price algorithm for solving the cutting strips problem (Q1364894) (← links)
- A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
- Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (Q1368436) (← links)
- On dominated terms in the general knapsack problem (Q1371953) (← links)
- On variations of the subset sum problem (Q1382248) (← links)
- Fast equi-partitioning of rectangular domains using stripe decomposition (Q1383377) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- A special class parametric of knapsack problems: Analytic aids and heuristics (Q1390270) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- A hybrid heuristic for the generalized assignment problem (Q1390290) (← links)
- Performance optimization of binary weighted current-steering D/A converters (Q1399038) (← links)
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network (Q1399109) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- The computation of the worst conditional expectation. (Q1427561) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
- A class of greedy algorithms for the generalized assignment problem (Q1570837) (← links)
- An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
