Journal Article |
File Downloads |
Abstract Views |

Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |

A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering |
0 |
0 |
4 |
5 |
0 |
1 |
12 |
18 |

A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
1 |

A node covering algorithm |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |

An Additive Algorithm for Solving Linear Programs with Zero-One Variables |
4 |
7 |
17 |
28 |
6 |
11 |
32 |
50 |

An Algorithm for Large Zero-One Knapsack Problems |
0 |
0 |
0 |
1 |
0 |
0 |
3 |
8 |

An Algorithm for the Three-Index Assignment Problem |
0 |
0 |
1 |
3 |
0 |
0 |
2 |
5 |

An Infeasibility-Pricing Decomposition Method for Linear Programs |
0 |
0 |
1 |
2 |
0 |
0 |
1 |
2 |

An Intersection Cut from the Dual of the Unit Hypercube |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
1 |

Combining Lift-and-Project and Reduce-and-Split |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
1 |

Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes |
1 |
1 |
1 |
2 |
1 |
1 |
3 |
4 |

Discrete Programming by the Filter Method |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Duality in Discrete Programming: II. The Quadratic Case |
0 |
0 |
2 |
5 |
1 |
1 |
4 |
17 |

Errata |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Erratum: Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes (Mathematics of Operations Research, Vol. 2, 1977, 15–19) |
0 |
0 |
1 |
1 |
1 |
1 |
3 |
3 |

Guided Local Search with Shifting Bottleneck for Job Shop Scheduling |
0 |
0 |
0 |
21 |
0 |
1 |
7 |
68 |

Intersection Cuts—A New Type of Cutting Planes for Integer Programming |
1 |
3 |
6 |
7 |
2 |
4 |
9 |
11 |

Intersection cuts from outer polars of truncated cubes |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
3 |

Letter to the Editor—A Note on the Branch-and-Bound Principle |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
2 |

Letter to the Editor—Comments on the Preceding Note |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
5 |

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm |
0 |
0 |
4 |
13 |
1 |
1 |
10 |
31 |

Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs |
0 |
0 |
1 |
2 |
0 |
0 |
2 |
4 |

Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework |
0 |
0 |
2 |
20 |
0 |
0 |
3 |
63 |

New classes of efficiently solvable generalized Traveling Salesman Problems |
0 |
1 |
1 |
3 |
0 |
2 |
5 |
18 |

Octane: A New Heuristic for Pure 0--1 Programs |
0 |
0 |
1 |
2 |
0 |
1 |
2 |
5 |

On the Generalized Transportation Problem |
0 |
0 |
2 |
7 |
0 |
0 |
2 |
32 |

On the Maximum Weight Clique Problem |
0 |
0 |
0 |
3 |
0 |
0 |
1 |
6 |

On the Set-Covering Problem |
0 |
0 |
1 |
4 |
1 |
1 |
3 |
9 |

On the Set-Covering Problem: II. An Algorithm for Set Partitioning |
1 |
1 |
1 |
4 |
1 |
2 |
4 |
10 |

Pivot and Complement--A Heuristic for 0-1 Programming |
1 |
3 |
3 |
10 |
3 |
6 |
11 |
30 |

Projecting systems of linear inequalities with binary variables |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
3 |

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization |
0 |
2 |
4 |
6 |
0 |
5 |
9 |
15 |

Solution of Large-Scale Transportation Problems Through Aggregation |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
2 |

Some thoughts on the development of integer programming during my research career |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
5 |

Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam |
0 |
0 |
0 |
9 |
0 |
0 |
1 |
30 |

Strengthening cuts for mixed integer programs |
0 |
0 |
3 |
65 |
0 |
1 |
6 |
112 |

Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

The Dual Method for the Generalized Transportation Problem |
0 |
0 |
0 |
7 |
0 |
0 |
1 |
28 |

The Fixed-Outdegree 1-Arborescence Polytope |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
2 |

The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling |
0 |
0 |
0 |
7 |
0 |
0 |
1 |
25 |

The Shifting Bottleneck Procedure for Job Shop Scheduling |
3 |
12 |
28 |
289 |
6 |
20 |
48 |
621 |

Total Journal Articles |
11 |
30 |
85 |
531 |
24 |
63 |
199 |
1,256 |