scientific article; zbMATH DE number 44282

Publication date 23 January 1993

approximate algorithms average performance computational complexity Fortran IV integer linear programming knapsack problems NP-hard problems worst case performance

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

scientific article; zbMATH DE number 432989
scientific article; zbMATH DE number 3989108
Algorithms for some hard knapsack problems
scientific article; zbMATH DE number 4202023
An algorithm for solving a class of knapsack problems and its generalization
Realization of knapsack problem solving algorithm and some of its applications
Knapsack problems: a parameterized point of view
An algorithm for the disjunctively constrained knapsack problem
scientific article; zbMATH DE number 1302173

Cited in

(only showing first 100 items - show all)

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
The 0-1 knapsack problem with fuzzy data
An algorithm for the generalized quadratic assignment problem
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
Algorithmic aspects for power-efficient hardware/software partitioning
Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
An exact algorithm for the fixed-charge multiple knapsack problem
A hybrid algorithm for the unbounded knapsack problem
A trust branching path heuristic for zero-one programming
Bidimensional packing by bilinear programming
Two heuristics for the one-dimensional bin-packing problem
GreedEx---a scalable clearing mechanism for utility computing
A matching algorithm for the distribution of human pancreatic islets
The transportation problem with exclusionary side constraints
Approximation algorithms for single machine scheduling with one unavailability period
New lower bounds based on column generation and constraint programming for the pattern minimization problem
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
A computational evaluation of a general branch-and-price framework for capacitated network location problems
Exact algorithms for the two-dimensional strip packing problem with and without rotations
Combinatorial optimization in system configuration design
A branch-and-price algorithm for the two-dimensional level strip packing problem
Priority algorithms for the subset-sum problem
Approximation algorithms for orthogonal packing problems for hypercubes
An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis
A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
The submodular knapsack polytope
Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
Knapsack problems with setups
Cut generation for an employee timetabling problem
Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
Heuristics for the 0-1 multidimensional knapsack problem
Lagrangean duals and exact solution to the capacitated \(p\)-center problem
Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
Market-based pricing in grids: on strategic manipulation and computational cost
An exact algorithm for large multiple knapsack problems
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
An exact algorithm for the capacitated facility location problems with single sourcing
CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
Specialized inspection problems in serial production systems
Bounds for nested knapsack problems
Packing problems
The vehicle routing problem: An overview of exact and approximate algorithms
A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
The capacitated distribution and waste disposal problem
A heuristic algorithm for the asymmetric capacitated vehicle routing problem
Auxiliary tool allocation in flexible manufacturing systems
Properties of some ILP formulations of a class of partitioning problems
A relation between the knapsack and group knapsack problems
Relaxation heuristics for a generalized assignment problem
A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
A lexicographic approach to bi-objective loading of a flexible assembly system
A decision support system for urban waste management
Integrated defect detection and optimization for cross cutting of wooden boards
Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
Forward-reserve allocation in a warehouse with unit-load replenishments
An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
A branch-and-bound algorithm for the two-dimensional vector packing problem
A set partitioning heuristic for the generalized assignment problem
Solving the 0-1 proportional knapsack problem by sampling
Reducing the number of variables in integer and linear programming problems
Solving binary cutting stock problems by column generation and branch- and-bound
A computational note on the Martello-Toth knapsack algorithm
A robust heuristic for the generalized assignment problem
Complexity of scheduling multiprocessor tasks with prespecified processors allocations
A polynomial approximation scheme for the subset sum problem
A genetic algorithm for the generalised assignment problem
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
A branch-and-price algorithm for solving the cutting strips problem
A simple dual algorithm for the generalised assignment problem
Heuristic and reduction algorithms for the knapsack sharing problem
A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
On dominated terms in the general knapsack problem
On variations of the subset sum problem
Fast equi-partitioning of rectangular domains using stripe decomposition
Some thoughts on combinatorial optimisation
A minimal algorithm for the multiple-choice knapsack problem
The bottleneck generalized assignment problem
Tabu search for the multilevel generalized assignment problem
Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
A special class parametric of knapsack problems: Analytic aids and heuristics
An expanding-core algorithm for the exact 0-1 knapsack problem
A hybrid heuristic for the generalized assignment problem
Performance optimization of binary weighted current-steering D/A converters
Approximation algorithms and relaxations for a service provision problem on a telecommunication network
An efficient fully polynomial approximation scheme for the Subset-Sum problem.
On the approximability of average completion time scheduling under precedence constraints.
Upper and lower bounds for the single source capacitated location problem.
Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
Average performance of greedy heuristics for the integer knapsack problem.
The computation of the worst conditional expectation.
A column generation approach to capacitated p-median problems
On the two-dimensional knapsack problem
New trends in exact algorithms for the \(0-1\) knapsack problem
Unbounded knapsack problem: Dynamic programming revisited
A class of greedy algorithms for the generalized assignment problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993418)