Programming for Combinatorial Optimization Problems CP-AI-OR 01,

Constraint Applications Using Graphy TheoryResultsHelmut SimonisApril25,2004References[1]R.Ahuja,T.Magnanti,and work Flows.Prentice Hall,1993.[2]C.Artigues,S.Selmokhtar,and D.Feillet.A new exact solution algo-rithm for the job-shop problem with sequence-dependent setup times.In J.Regin and M.Rueher,editors,Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR2004,pages37–49,Nice,France,April2004.Springer. [3]J.Bang-Jensen and G.Gutin.DIGRAPHS Theory,Algorithms andApplications.Springer,2002.[4]N.Barnier and P.Brisset.Graph coloring for air trafficflow manage-ment.In Integration of AI and OR Techniques in Constraint Program-ming for Combinatorial Optimization Problems CP-AI-OR02,2002. [5]N.Beldiceanu.Global constraints as graph properties on a structurednetwork of elementary constraints of the same type.In Principles and Practice of Constraint Programing-CP2000,2000.[6]T.Benoist,burthe,and grange relaxationand constraint programming collaborative schemes for travelling tour-nament problems.In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR01, 2001.[7]R.Bent and P.Van Hentenryck.A two-stage hybrid algorithm for pickupand delivery vehicle routing probelms with time windows.In F.Rossi,1editor,Principles and Practice of Constraint Programing-CP2003, pages123–137,Kinsale,Ireland,September2003.Springer.[8]A.Bockmayr,N.Pisaruk,and workflow problkemsin constraint programming.In Principles and Practice of Constraint Programing-CP2001,2001.[9]E.Bourreau.Traitement de Contraintes sur les Graphes en Program-mation par Contraintes.PhD thesis,L’Universite de Paris13-Insti-tut Galilee Laboratoire d’Informatique de Paris Nord(L.I.P.N.),March 1999.[10]M.Brdys,T.Creemers,H.Goosens,J.Riera, A.Heinsbroek,andZ.Lisiak.CLOCWiSe:Constraint logic for operational constrol of water systems.Technical report,UPC,2003.[11]Y.Caseau,burthe,and G.Silverstein.A meta-heuristc factoryfor vehicle routing problems.In Principles and Practice of Constraint Programing-CP1999,1999.[12]A.Chabrier.Heuristic branch-and-price-and-cut to solve a network de-sign problem.In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CPAIOR03, 2003.[13]R.Diestel.Graph Theory.Springer,2000.[14]E.Domemjoud,C.Kirschner,and J.Zhou.Gerating feasible sched-ules for a pick-up and delivery problem.In Principles and Practice of Constraint Programing-CP1998,1998.[15]F.Focacci,A.Lodi,and ano.Cost-based domainfiltering.InPrinciples and Practice of Constraint Programing-CP1999,1999. [16]F.Focacci and W.Nuijten.A constraint propagation algorithm forscheduling with sequence dependent setup times.In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Op-timization Problems CP-AI-OR2000,2000.[17]F.Focacci and P.Shaw.Pruning sub-optimal search branches usinglocal search.In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR02, 2002.2[18]C.Frei and B.Faltings.Resource allocation in networks using abstrac-tion and constraint satisfaction techniques.In Principles and Practice of Constraint Programing-CP1999,1999.[19]T.Fruehwirth and P.Brisset.Optimal placement of base stations inwireless indoor telecommunication.In Principles and Practice of Con-straint Programing-CP1998,1998.[20]M.Gronkvist.A constraint programming model for tail assignment.InJ.Regin and M.Rueher,editors,Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR2004,pages142–156,Nice,France,April2004.Springer. [21]O.Kamarainen and H.El Sakkout.Local probing applied to networkrouting.In J.Regin and M.Rueher,editors,Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR04,Nice,France,April2004.Springer.[22]E.Kilborn.Aircraft assignment using constraint programming.In Prin-ciples and Practice of Constraint Programing-CP2001,2001.[23]N.Kohl.Application fo OR and CP techniques in a real world crewscheduling system.In Integration of AI and OR Techniques in Con-straint Programming for Combinatorial Optimization Problems CP-AI-OR2000,2000.[24]u,Y.Lim,and Q.Liu.Diversification of neighboourhood viaconstraint-based local search and its application to VRPTW.In Inte-gration of AI and OR Techniques in Constraint Programming for Com-binatorial Optimization Problems CP-AI-OR2001,2001.[25]uvergne,P.David,and P.Bauzimault.Connections reservationwith rerouting for ATM networks:A hybrid approach with constraints.In P.Van Hentenryck,editor,Principles and Practice of Constraint Pro-graming-CP2002,Cornell University,Ithaca,N.Y.,September2002.Springer.[26]S.Loudni,P.David,and P.Boizumault.On-line resource allocation forATM networks with rerouting.In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR03,2003.3[27]L.Michel and P.Van Hentenryck.Maintaining logest paths incremen-tally.In F.Rossi,editor,Principles and Practice of Constraint Pro-graming-CP2003,pages540–554,Kinsale,Ireland,September2003.Springer.[28]W.Ouaja and B.Richards.Constrained routing for MPLS traffic engi-neering:A hybrid approach.In SIGCOMM2003,September2003. [29]C.Le Pape,L.Perron,J.Regin,and P.Shaw.Robust and parallelsolving of a network design problem.In P.Van Hentenryck,editor, Principles and Practice of Constraint Programing-CP2002,Cornell University,Ithaca,N.Y.,September2002.Springer.[30]J.Regin.Arc consistency for global cardinality constraints with costs.In Principles and Practice of Constraint Programing-CP1999,1999.[31]L.Ros,T.Creemers,E.Tourouta,and J.Riera.A global constraintmodel for integrated routeing and scheduling on a transmission network.In7th International Conference on Information Networks,Systems and Technologies,October2001.[32]L.Rousseau,M.Gendreau,and G.Pesant.Solving small VRPTWswith constraint programming based column generation.In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR02,2002.[33]M.Sellmann.Cost-basedfiltering for shorter path constraints.InF.Rossi,editor,Principles and Practice of Constraint Programing-CP2003,pages679–693,Kinsale,Ireland,September2003.Springer.[34]ing constraint programming and local search methods tosolve vehicle routing problems.In Principles and Practice of Constraint Programing-CP1998,1998.[35]P.Vilim.Batch processing with sequence dependent setup times.InP.Van Hentenryck,editor,Principles and Practice of Constraint Pro-graming-CP2002,Cornell University,Ithaca,N.Y.,September2002.Springer.[36]Q.Xia,A.Eremin,and M.Wallace.Problem decomposition for trafficdiversions.In J.Regin and M.Rueher,editors,Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR2004,pages348–363,Nice,France,April2004.Springer.4[37]N.Yorke-Smith and C.Gervet.On constraint problems with incompleteor erroneuos data.In P.Van Hentenryck,editor,Principles and Practice of Constraint Programing-CP2002,Cornell University,Ithaca,N.Y., September2002.Springer.5。