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 |
18 |
0 |
2 |
8 |
51 |

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

An Additive Algorithm for Solving Linear Programs with Zero-One Variables |
0 |
0 |
3 |
82 |
3 |
5 |
17 |
235 |

An Algorithm for Large Zero-One Knapsack Problems |
0 |
5 |
10 |
35 |
0 |
5 |
14 |
78 |

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

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

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

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

Errata |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |

Intersection Cuts—A New Type of Cutting Planes for Integer Programming |
0 |
1 |
3 |
22 |
0 |
1 |
3 |
35 |

Intersection cuts from outer polars of truncated cubes |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
5 |

Job Shop Scheduling With Deadlines |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
10 |

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

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

Logical Constraints as Cardinality Rules: Tight Representation |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm |
0 |
2 |
5 |
32 |
0 |
2 |
11 |
74 |

Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs |
0 |
0 |
0 |
7 |
0 |
0 |
0 |
18 |

New classes of efficiently solvable generalized Traveling Salesman Problems |
0 |
0 |
1 |
10 |
0 |
0 |
1 |
35 |

Octane: A New Heuristic for Pure 0--1 Programs |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
9 |

On the Set-Covering Problem |
0 |
0 |
2 |
7 |
0 |
0 |
2 |
13 |

On the Set-Covering Problem: II. An Algorithm for Set Partitioning |
0 |
0 |
1 |
8 |
0 |
0 |
1 |
16 |

Projecting systems of linear inequalities with binary variables |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
8 |

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization |
0 |
0 |
0 |
10 |
2 |
2 |
3 |
33 |

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

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

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 |
11 |
0 |
0 |
1 |
34 |

Strengthening cuts for mixed integer programs |
0 |
0 |
4 |
75 |
0 |
0 |
6 |
130 |

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

When Lift-and-Project Cuts Are Different |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
10 |

Total Journal Articles |
0 |
9 |
37 |
341 |
5 |
19 |
80 |
849 |