Decomposition and Dynamic Cut Generation in Integer Linear Programming

[1]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[2]  R. G. Parker,et al.  Introduction to Discrete Optimization , 1988 .

[3]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[4]  Egon Balas,et al.  Linear-Time Separation Algorithms for the Three-Index Assignment Polytope , 1993, Discret. Appl. Math..

[5]  L. Hawken,et al.  Effects of the Behavior Education Program (BEP) on Office Discipline Referrals of Elementary School Students , 2007 .

[6]  Xiao-Hua Zhou,et al.  Statistical Methods in Diagnostic Medicine , 2002 .

[7]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[8]  R. Kline.  Principles and practice of structural equation modeling, 2nd ed. , 2005 .

[9]  Ted K. Ralphs,et al.  Parallel branch and cut for vehicle routing , 1995 .

[10]  M. Pepe.  The Statistical Evaluation of Medical Tests for Classification and Prediction , 2003 .

[11]  R. Kipp Martin,et al.  Large scale linear and integer optimization - a unified approach , 1998 .

[12]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[13]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[14]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[15]  Egon Balas,et al.  Facets of the three-index assignment polytope , 1989, Discret. Appl. Math..

[16]  S. Messick.  Test Validity: A Matter of Consequence , 1998 .

[17]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[18]  Hoesel van Cpm,et al.  Polyhedral techniques in combinatorial optimization I: theory , 1996 .

[19]  M. Wolf,et al.  Social validity: the case for subjective measurement or how applied behavior analysis is finding its heart. , 1978, Journal of applied behavior analysis.

[20]  Jacek Gondzio,et al.  Column Generation With a Primal-Dual Method , 1996 .

[21]  Monique Guignard-Spielberg.  Efficient cuts in Lagrangean 'Relax-and-cut' schemes , 1998, Eur. J. Oper. Res..

[22]  M. Guignard.  Lagrangean relaxation , 2003 .

[23]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[24]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[25]  P. Bentler.  Comparative Fit Indices in Structural Models , 1990 .

[26]  Donald L. Miller.  A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems , 1995, INFORMS J. Comput..

[27]  Francisco Barahona,et al.  Plant location with minimum inventory , 1998, Math. Program..

[28]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[29]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..

[30]  Karen Aardal,et al.  Polyhedral Techniques in Combinatorial Optimization , 1995 .

[31]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[32]  Abilio Lucena.  Non Delayed Relax-and-Cut Algorithms , 2005, Ann. Oper. Res..

[33]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[34]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[35]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[36]  T. Brown,et al.  Confirmatory Factor Analysis for Applied Research , 2006 .

[37]  Abilio Lucena,et al.  Lagrangian heuristics for the linear ordering problem , 2004 .

[38]  F. Gresham,et al.  Proactive, Early Screening to Detect Behaviorally At-Risk Students: Issues, Approaches, Emerging Innovations, and Professional Practices. , 2007 .

[39]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[40]  Ulrich Faigle,et al.  A Lagrangian relaxation approach to the edge-weighted clique problem , 2001, Eur. J. Oper. Res..

[41]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[42]  J. Tind.  Decomposition in integer programming , 1989 .

[43]  Giovanni Rinaldi,et al.  Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

[44]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[45]  Oscar Porto,et al.  Modelos e Algoritmos para o Problema de Alocação Generalizada (PAG) e Aplicações , 2003 .

[46]  Thomas M. Liebling,et al.  Tree polytope on 2-trees , 1994, Math. Program..

[47]  Michel Gendreau,et al.  Interior point stabilization for column generation , 2007, Oper. Res. Lett..

[48]  M. P. Aragão,et al.  Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms , 2003 .

[49]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[50]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[51]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[52]  Dennis Huisman,et al.  Combining Column Generation and Lagrangian Relaxation , 2005 .

[53]  Martin W. P. Savelsbergh,et al.  A generic view of Dantzig-Wolfe decomposition in mixed integer programming , 2006, Oper. Res. Lett..

[54]  J A Swets,et al.  Better decisions through science. , 2000, Scientific American.

[55]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[56]  Abilio Lucena,et al.  Stronger K-tree relaxations for the vehicle routing problem , 2004, Eur. J. Oper. Res..

[57]  F. Gresham.  Assessment of Social Skills in Students with Emotional and Behavioral Disorders , 2000 .

[58]  Alexander Schwartz,et al.  Implementing weighted b-matching algorithms: towards a flexible software design , 1999, JEAL.

[59]  S. Messick.  Validity of Psychological Assessment: Validation of Inferences from Persons' Responses and Performances as Scientific Inquiry into Score Meaning. Research Report RR-94-45. , 1994 .

[60]  R. G. Parker,et al.  Discrete optimization , 1988, Computer science and scientific computing.

[61]  F. Vanderbeck,et al.  A generic view at the Dantzig-Wolfe decomposition approach in Mixed Integer Programming: paving the way for a generic code. , 2005 .

[62]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[63]  Cid C. de Souza,et al.  Optimal rectangular partitions , 2003, Networks.

[64]  Robert H. Horner,et al.  The School-Wide Evaluation Tool (SET) , 2004 .

[65]  Terry P. Harrison,et al.  Lot-Sizing with Start-Up Times , 1998 .

[66]  Egon Balas,et al.  An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..

[67]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[68]  G. Kochman.  Decomposition in integer programming , 1976 .

[69]  Shanna Hagan-Burke,et al.  Overview of the Functional Behavioral Assessment Process , 2000 .

[70]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[71]  L. Trotter,et al.  A new generic separation routine and its application in a branch and cut algorithm for the capacitated vehicle routing problem , 1999 .

[72]  Maddalena Nonato,et al.  Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development , 1995 .

[73]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[74]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..