scientific article; zbMATH DE number 3550465

zbMath0353.90060MaRDI QIDQ4124603

Nemhauser, George I., D. R. Fulkerson, Leslie E. jun. Trotter

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (36)

An exact algorithm for the maximum stable set problem ⋮ Improved solutions to the Steiner triple covering problem ⋮ An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ An algorithm for large scale 0-1 integer programming with application to airline crew scheduling ⋮ Minimal covering problem and PLA minimization ⋮ On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts ⋮ 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 ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ Solving hard set covering problems ⋮ 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 ⋮ Constraint Orbital Branching ⋮ Orbital branching ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Russian doll search for the Steiner triple covering problem ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ An interior point algorithm to solve computationally difficult set covering problems ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Classification of orthogonal arrays by integer programming ⋮ A biased random-key genetic algorithm for the Steiner triple covering problem ⋮ Hooked on IP ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Elementary closures for integer programs. ⋮ ZI round, a MIP rounding heuristic ⋮ Solving large Steiner Triple Covering Problems ⋮ A note on some computationally difficult set covering problems ⋮ Greedy randomized adaptive search procedures ⋮ Solving multiple scenarios in a combinatorial auction ⋮ An application of the Hermite normal form in integer programming ⋮ Unnamed Item ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem ⋮ An algorithm of internal feasible directions for linear integer programming ⋮ A tabu search approach to the constraint satisfaction problem as a general problem solver

This page was built for publication: