The following pages link to (Q4124603):
Displaying 37 items.
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Hooked on IP (Q537605) (← links)
- Orbital branching (Q623461) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- An application of the Hermite normal form in integer programming (Q757241) (← links)
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling (Q1897393) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- Minimal covering problem and PLA minimization (Q3735634) (← links)
- A note on some computationally difficult set covering problems (Q3867546) (← links)
- (Q5708518) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- A random-key GRASP for combinatorial optimization (Q6668154) (← links)
