The following pages link to (Q3993418):
Displaying 50 items.
- Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
- An analysis of lower bound procedures for the bin packing problem (Q1886845) (← links)
- A compact model and tight bounds for a combined location-routing problem (Q1886846) (← links)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- A two-phase algorithm for the partial accessibility constrained vehicle routing problem (Q1908293) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Local search with memory: Benchmarking RTS (Q1908991) (← links)
- An improved lower bound for the bin packing problem (Q1917305) (← links)
- A new algorithm for the integer knapsack problem and its parallelization (Q1919114) (← links)
- Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- The knapsack problem with neighbour constraints (Q1932367) (← links)
- On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization (Q1935548) (← links)
- Optimal partial hedging of an American option: shifting the focus to the expiration date (Q1935932) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
- A branch-and-bound approach to the optimization of redundant software under failure correlation (Q1941955) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives (Q1974571) (← links)
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259) (← links)
- A parallel implementation of the maximum likelihood method in positron emission tomography image reconstruction. (Q1978414) (← links)
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints (Q1979180) (← links)
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457) (← links)
- Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
- Efficient crowdsourcing of unknown experts using bounded multi-armed bandits (Q2014933) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
- Cooperative multiobjective optimization with bounds on objective functions (Q2022239) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
