scientific article; zbMATH DE number 3550465

Cited in

(39)

Solving multiple scenarios in a combinatorial auction
On the facial structure of the set covering polytope
A probabilistic heuristic for a computationally difficult set covering problem
Facets and lifting procedures for the set covering polytope
Matrices of zeros and ones with fixed row and column sum vectors
An interior point algorithm to solve computationally difficult set covering problems
An exact algorithm for the maximum stable set problem
Graph theoretic relaxations of set covering and set partitioning problems
The design of a 0-1 integer optimizer and its application in the Carmen system
A tabu search approach to the constraint satisfaction problem as a general problem solver
Measuring instance difficulty for combinatorial optimization problems
Greedy randomized adaptive search procedures
Combinatorial analysis. (Matrix problems, choice theory)
An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
Solving hard set covering problems
Partial hyperplane activation for generalized intersection cuts
An improved configuration checking-based algorithm for the unicost set covering problem
Solving large Steiner Triple Covering Problems
Classification of orthogonal arrays by integer programming
Improved solutions to the Steiner triple covering problem
An efficient local search heuristic with row weighting for the unicost set covering problem
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
Constraint Orbital Branching
Minimal covering problem and PLA minimization
A note on some computationally difficult set covering problems
Using symmetry to optimize over the Sherali-Adams relaxation
Hooked on IP
scientific article; zbMATH DE number 2230226 (Why is no real title available?)
Elementary closures for integer programs.
Orbital branching
Russian doll search for the Steiner triple covering problem
A random-key GRASP for combinatorial optimization
A biased random-key genetic algorithm for the Steiner triple covering problem
Optimal cycle selections: an experimental assessment of integer programming formulations
ZI round, a MIP rounding heuristic
Linear programming hierarchies collapse under symmetry
An application of the Hermite normal form in integer programming
A heuristic algorithm for the multidimensional zero-one knapsack problem
An algorithm of internal feasible directions for linear integer programming

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 Q4124603)