Studies in Integer Programming

P.L. Hammer, E.L. Johnson, B.H. Korte and G.L. Nemhauser (Eds.)978-0-7204-0765-5

In recent years, there has been an explosion of interest in the science of adhesion. Despite its multidisciplinary and undoubtedly industrial character, the wealth of phenomena to be found in the study of adhesion has drawn researchers from many seemingly disparate scientific disciplines. The intention of these books is to provide an updated view of the state of the art of adhesion science and to fill in the rather large gap in the compilation of knowledge related to adhesion science.This set of two volumes describes adhesion science from three fundamental perspectives: mechanics, surfaces and chemistry. Volume 1 focuses attention on the contribution of mechanic principles and solutions to understanding the fabrication, design, analysis, and testing of adhesive bonds. It also offers a comprehensive overview of the current understanding of stresses, deformation, and fracture parameters associated with a range of adhesive bonds.

---

Table of contents :
Content:
Edited by
Pages ii-iii

Copyright page
Page iv

Preface
Page v
P.L. Hammer, E.L. Johnson, B.H. Korte, G.L. Nemhauser, P. Schweitzer

Reduction and Decomposition of Integer Programs Over Cones Original Research Article
Pages 1-11
Achim Bachem

Some Valid Inequalities for the Set Partitioning Problem Original Research Article
Pages 13-47
Egon Balas

Backtracking Algorithms for Network Reliability Analysis Original Research Article
Pages 49-64
Michael Ball, Richard M. Van Slyke

Coloring the Edges of A Hypergraph and Linear Programming Techniques Original Research Article
Pages 65-78
Claude Berge, Ellis L. Johnson

Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem Original Research Article
Pages 79-97
Ole Bilde, Jakob Krarup

Partial Orderings in Implicit Enumeration Original Research Article
Pages 99-116
V. Joseph Bowman Jr., James H. Starr

A Subadditive Approach to Solve Linear Integer Programs Original Research Article
Pages 117-143
Claude-Alain Burdet, Ellis L. Johnson

Aggregation of Inequalities in Integer Programming Original Research Article
Pages 145-162
Václav Chvátal, Peter L. Hammer

On the Uncapacitated Location Problem Original Research Article
Pages 163-177
Gerard Cornuejols, Marshall Fisher, George L. Nemhauser

Some Coloring Techniques Original Research Article
Pages 179-184
D. de Werra

A Min-Max Relation for Submodular Functions on Graphs Original Research Article
Pages 185-204
Jack Edmonds, Rick Giles

How Can Specialized Discrete and Convex Optimization Methods Be Married? Original Research Article
Pages 205-220
A.M. Geoffrion

On Integer and Mixed Integer Fractional Programming Problems Original Research Article
Pages 221-231
Daniel Granot, Frieda Granot

Graphs with Cycles Containing Given Paths Original Research Article
Pages 233-245
M. Grötschel

Algorithms for Exploiting the Structure of the Simple Plant Location Problem Original Research Article
Pages 247-271
Monique Guignard, Kurt Spielberg

Reduction Methods for State Enumeration Integer Programming Original Research Article
Pages 273-285
Monique Guignard, Kurt Spielberg

Subdegrees and Chromatic Numbers of Hypergraphs Original Research Article
Pages 287-292
Pierre Hansen

Cutting-Plane Theory: Disjunctive Methods Original Research Article
Pages 293-330
R.G. Jeroslow

A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness Original Research Article
Pages 331-342
Eugene L. Lawler

Complexity of Machine Scheduling Problems Original Research Article
Pages 343-362
J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker

Certain Duality Principles in Integer Programming Original Research Article
Pages 363-374
L. Lovász

Parametric Integer Programming: the Right-Hand-Side Case Original Research Article
Pages 375-390
Roy E. Marsten, Thomas L. Morin

An Example of Dual Polytopes in the Unit Hypercube Original Research Article
Pages 391-392
J.F. Maurras

Implicit Enumeration with Generalized Upper Bounds Original Research Article
Pages 393-402
P. Mevert, U. Suhl

On Some Nonlinear Knapsack Problems Original Research Article
Pages 403-414
I. Michaeli, M.A. Pollatschek

The Minimal Integral Separator of A Threshold Graph Original Research Article
Pages 415-419
James Orlin

On the Complexity of Set Packing Polyhedra Original Research Article
Pages 421-434
Manfred W. Padberg

Properties of Facets of Binary Polytopes Original Research Article
Pages 435-456
Uri N. Peled

Vertex Generation Methods for Problems with Logical Constraints Original Research Article
Pages 457-466
David S. Rubin

Sensitivity Analysis in Integer Programming Original Research Article
Pages 467-477
Jeremy F. Shapiro

A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp’s 1-Tree Relaxation Original Research Article
Pages 479-493
T.H.C. Smith, G.L. Thompson

Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems Original Research Article
Pages 495-506
T.H.C. Smith, V. Srinivasan, G.L. Thompson

On Antiblocking Sets and Polyhedra Original Research Article
Pages 507-515
Jørgen Tind

On the Generality of Multi-Terminal Flow Theory Original Research Article
Pages 517-525
L.E. Trotter Jr.

Valid Inequalities, Covering Problems and Discrete Dynamic Programs Original Research Article
Pages 527-538
Laurence A. Wolsey

Some Partial Orders Related to Boolean Optimization and the Greedy Algorithm Original Research Article
Pages 539-550
Uwe Zimmermann

Integer Linear Programming with Multiple Objectives Original Research Article
Pages 551-562
Stanley Zionts