scientific article; zbMATH DE number 4121754
From MaRDI portal
Publication:4735035
DOI<151::AID-NAV3220370110>3.0.CO;2-2 10.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2zbMath0684.90063MaRDI QIDQ4735035
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrangian relaxationheuristicsubgradient optimizationComputational resultsnon-unicost set-covering problems
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)
Related Items
Dissecting the duality gap: the supporting hyperplane interpretation revisited, A surrogate heuristic for set covering problems, Two new heuristics for the location set covering problem, An efficient local search heuristic with row weighting for the unicost set covering problem, An effective and simple heuristic for the set covering problem, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Relaxation heuristics for the set multicover problem with generalized upper bound constraints, Dynamic bundle methods, Algorithms for railway crew management, Solving large set covering problems for crew scheduling, Robust min-max regret covering problems, Solving the anti-covering location problem using Lagrangian relaxation, A binary cat swarm optimization algorithm for the non-unicost set covering problem, A theoretical justification of the set covering greedy heuristic of Caprara et al., A hybrid heuristic for the set covering problem, A GRASP algorithm to solve the unicost set covering problem, On a linearization technique for solving the quadratic set covering problem and variations, Graph theoretic relaxations of set covering and set partitioning problems, Matheuristics: survey and synthesis, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Evaluation of reliability bounds by set covering models., A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem, An improved configuration checking-based algorithm for the unicost set covering problem, A heuristic algorithm for the set covering problem, Enhancing an algorithm for set covering problems, Solving the wire-harness design problem at a European car manufacturer, Experiments with LAGRASP heuristic for set \(k\)-covering, A mixed integer linear program and tabu search approach for the complementary edge covering problem, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, A 3-flip neighborhood local search for the set covering problem, Avoiding redundant columns by adding classical Benders cuts to column generation subproblems, Set covering approach for reconstruction of sibling relationships, The set covering problem revisited: an empirical study of the value of dual information, An exact algorithm for solving the bilevel facility interdiction and fortification problem, Lagrangean heuristics for location problems, A new approach for solving set covering problem using jumping particle swarm optimization method, An adaptation of SH heuristic to the location set covering problem, A genetic algorithm for the set covering problem, Simple Lagrangian heuristic for the set covering problem, Computational experience with approximation algorithms for the set covering problem, A Lagrangian-based heuristic for large-scale set covering problems, A neural network for the minimum set covering problem, Exploring further advantages in an alternative formulation for the set covering problem, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, Column generation extensions of set covering greedy heuristics, Experiments with parallel branch-and-bound algorithms for the set covering problem, A parallel genetic algorithm to solve the set-covering problem, Tabu search heuristics for the vehicle routing problem with time windows.
