Bs. in Computer Science and Operational Research, rank : 1st Université Blaise Pascal, Clermont II, Clermont-Ferrand, France
|
|
- Annabelle Pierce
- 6 years ago
- Views:
Transcription
1 Mathieu LACROIX Laboratoire LAMSADE Université Paris Dauphine Bureau C605 Place du Maréchal de Lattre de Tassigny Paris cedex 16 - France Tél : +33 (0) lacroix@lamsade.dauphine.fr url : Date of birth : April 28, 1982 Nationality : French Degrees held Ph.D. Student in Combinatorial Optimization Laboratoire d Informatique, de Modélisation et d Optimisation des Systèmes (LIMOS) Subject of the thesis : The preemptive pickup and delivery problem : complexity, models and polyhedra. Supervisors : A. R. Mahjoub and A. Quilliot Co-supervisor : H. Kerivin Master degree in Operational Research, rank : 1st Laboratoire d Informatique, de Modélisation et d Optimisation des Systèmes (LIMOS) Subject : Polyhedral study of the preemptive pickup and delivery with split loads Supervisors : A. R. Mahjoub and A. Quilliot Co-supervisor : H. Kerivin Bs. in Computer Science and Operational Research, rank : 1st 2000 Baccalauréat Mathematics and physics, Lycée Blaise Pascal, Clermont-Ferrand, France Professional experiences Lecture, Department of Mathematics and Computer Science, Université Paris- Dauphine, France Researcher, Laboratoire LIMOS, Université Blaise-Pascal, Clermont II, Clermont- Ferrand, France. 1
2 Research Activities My research is related to the field of Combinatorial Optimization. It concerns the so-called pickup and delivery problem. We have first studied the complexity of some related problems and given integer programming formulations for some variants of the problem. Now, we are studying the convex hull of the solutions of the problem. Our aim is to develop efficient cutting plane based methods for solving big size instances of the problem. Combinatorial Optimization is an area of computer science and applied mathematics. It uses combinatorial, linear programming and algorithmic technics to solve optimization problems with discrete structures (usually a graph). These problems consist in finding the best element in a finite set. Several problems can be formulated as combinatorial optimization problems, especially transportation ones. However, even if the number of solutions is finite, the combinatorial explosion prevents from solving these problems by enumeration. Thus, it is necessary to use other technics which are more efficient. One of the most efficient methods to solve combinatorial optimization problems is the so-called polyhedral method. It consists in describing the convex hull of the solutions of the problem with the use of linear inequalities, which leads to a linear program that can be solved in polynomial time. Unfortunatelly, if the problem is NP-complete, there is a little chance to describe the convex hull. However, a partial description allows to design efficient branch and cut algorithms to solve the problem. Pickup and delivery problems. Transportation problems form a wilde area of operations research problems. This can be explained by the more and more important part of transportation in economy, due to globalization and intensification of exchanges of products and persons. Therefore, it is very important to improve algorithmic technics solving transportation problems and to consider more and more variants of such problems to match as close as possible real-world applications. To this aim, my PhD subject is concerned with preemptive pickup and delivery problems in which demands can be temporarily dropped anywhere in the network to be reloaded afterwards. Branch and cut algorithms. We have first considered the preemptive pickup and delivery problem with split demands, that is, when these latter can also be carried through different paths. We formulated this problem using two mixed-integer linear problems based on a space-time graph. We solved these two formulations with a branch-and-cut algorithm. This work led to the publications [1],[2]. Complexity and Modeling. We have particularly focused on the case when only one vehicle is available and the demands cannot be splitted (but they can still be temporarily dropped anywhere). This problem, called the Single-vehicle Preemptive Pickup and Delivery Problem, is still NP-hard. We have first studied the structure of the solutions of the problem. We have shown that a solution has to be described by the set of arcs traversed by the vehicle, the order in which these arcs are traversed and the set of arcs of the demand paths. We have also proved that these informations are necessary to check in polynomial time if a solution is feasible. This means that if one of these informations is missing, then checking if a solution is feasible is an NP-complete problem. Finally, we have given an integer linear programming formulation for this problem. We have also studied this problem when only one demand is carried at the same time (unitary case). The problem remains NP-hard in this case. However, we have shown that the information concerning the sequence of arcs traversed by the vehicle is no more necessary to check in polynomial time if a solution is feasible. Indeed, in this case, the order on the arcs can be obtained from the sets of arcs traversed by the vehicle and the demands. We have also introduced a new formulation for this 2
3 variant of the single-vehicle preemptive pickup and delivery problem based on these results. This work on complexity and modeling gave rise to the submitted articles [3], [4]. Polyhedral study and algorithms. Currently, we are studying the facial structure of the polytope of the unitary single-vehicle preemptive pickup and delivery problem. We have given necessary and sufficient conditions for the inequalities of the formulation to define facets. Based on these results, we have developed a branch-and-cut algorithm to solve this problem [5]. In order to improve this algorithm, we have also devised a metaheuristic [6] for computing an upper bound (allowing to prun some nodes in the branch tree). The originality of this metaheuristic comes from the fact that the solutions are coded using a bi-tree. Indeed, a deep study of the properties and structures of the optimal solutions has allowed us to represent every solution thanks to a bi-tree. Structural analysis of algebraic-differential systems with conditional equations Currently, I am collaborating with A. R. Mahjoub and S. Martin within an ANR project. The aim of the project is to develop a parallel algorithm for solving algebraic-differential systems when the system has conditional equations. One of the steps in the resolution of the system is the analysis of the structure of the system. This consists in checking if the system is feasible in all the configurations of the conditions. We have shown that this problem reduces to the Perfect Matching-Free Induced Subgraph Problem in Bipartite Graphs that can be stated as follows. Consider a bipartite graph given by the vertex sets V 1 and V 2 where the set of edges is the union of two sets, called True and False respectively (edges may belong to the two sets). Given a true or false value for each vertex of V 1, we consider the graph induced by the set of edges belonging to True incident to a vertex of V 1 with a true value and the set of edges belonging to False incident to a vertex of V 1 with a false value. The problem consists then in checking if there exists an assignment of true and false values to the vertices of V 1 so that the induced subgraph does not contain a perfect matching. We have first shown that this problem is NP-complete. We have also given formulations for the problem in terms of integer linear programs. In addition, we have shown that this problem reduces to the stable set problem in an auxiliary graph [7]. We are now studying the polyhedra of these formulations for devising a branch-and-cut algorithm for the problem. Future research In what concerns the unitary single-vehicle preemptive pickup and delivery problem, we want to more investigate the polyhedral structure of the problem. Indeed, we want to identify further facets for this problem in order to enforce the linear relaxation and obtain strenghtened lower bounds for the branch-and-cut algorithm. We also want to give a complete linear description of the associated polytope when the graph is a cactus or a serie-parallel graph. We already have some preliminary results for the case when the graph is a circuit. We also want to study an arc-path formulation for the problem and thus develop a branch-and-cut-and-price algorithm using this approach. It would also be interesting to consider other variants of the preemptive pickup and delivery problem. A first extension we would like to investigate is when several vehicles are used. We would also like to continue our polyhedral study of the formulation related to the problem of the structural analysis of the algebraic-differential systems. 3
4 Publications International journals [1] H. Kerivin, M. Lacroix, A. R. Mahjoub and A. Quilliot, The splittable pickup and delivery problem with reloads, European Journal of Industrial Engineering (EJIE), Vol. 2, N. 2, pages (2008). Proceedings [2] H. Kerivin, M. Lacroix, A. R. Mahjoub and A. Quilliot, The capacitated vehicle routing problem with reloads, Proceedings of International Conference on Service System and Service Management (IEEE), pages (2006). Submitted papers [3] H. Kerivin, M. Lacroix and A. R. Mahjoub, On the complexity of the Eulerian closed walk with precedence path constraints problem, submitted to ACM Transactions on Algorithms. [4] H. Kerivin, M. Lacroix and A. R. Mahjoub, Models for the single-vehicle preemptive pickup and delivery problem, submitted to Journal of Combinatorial Optimization (JOCO). Papers in preparation [5] H. Kerivin, M. Lacroix and A. R. Mahjoub, Polyhedral results for the unitary preemptive pickup and delivery problem, in preparation. [6] H. Kerivin, M. Lacroix, A. Quilliot and H. Toussaint, A heuristic for solving the unitary preemptive pickup and delivery problem, in preparation. [7] M. Lacroix, A. R. Mahjoub and S. Martin, On the structural analysis problem of algebraicdifferential systems, in preparation. Communications at conferences [8] H. Kerivin, M. Lacroix and A. R. Mahjoub, Le problème de la grue préemptif asymétrique : polyèdre et algorithme de coupes et branchements, 10 ème Congrès de la Société Française de Recherche Opérationnelle et d Aide à la Décision (ROADEF2009), february 2009, Nancy, France. [9] H. Kerivin, M. Lacroix and A. R. Mahjoub, The single-vehicle preemptive pickup and delivery problem, 13 th Combinatorial Optimization Workshop (on invitation), january 2009, Aussois, France. [10] H. Kerivin, M. Lacroix and A. R. Mahjoub, Le problème de cueillettes et livraisons préemptif avec un véhicule, 9 ème Congrès de la Société Française de Recherche Opérationnelle et d Aide à la Décision (ROADEF2008), february 2008, Clermont-Ferrand, France. [11] H. Kerivin, M. Lacroix and A. R. Mahjoub, The single-vehicle preemptive pickup and delivery problem, special session Combinatorial Optimization, International Conference on nonconvex 4
5 programming : LOCAL and GLOBAL approaches (NCP07), december 2007, Rouen, France. [12] H. Kerivin, M. Lacroix and A. R. Mahjoub, Formulations pour le problème de cueillettes et livraisons préemptif avec un véhicule, 4 ème Journées Polyèdre et Optimisation Combinatoire (JPOC4), june 2007, Évry, France. [13] H. Kerivin, M. Lacroix, A. R. Mahjoub and A. Quilliot, The capacitated vehicle routing problem with reloads, International Conference Service System and Service Management (IEEE), october 2006, Troyes, France. [14] H. Kerivin, M. Lacroix, A. R. Mahjoub and A. Quilliot, Le problème de trajets de véhicules avec déchargements/rechargements sous contraintes de capacités, 6 ème Congrès de la Société Française de Recherche Opérationnelle et d Aide à la Décision (ROADEF2005), february 2005, Lille, France. Other activities Co-supervisor of a master degree thesis on the single-vehicle preemptive pickup and delivery problem and of a training course about graph libraries (Boost Graph Library and Coin Graph Classes). Computer science languages and Optimization softwares Operating systems : Linux, Unix, Windows Programming languages : C, C++, JAVA, Pascal, SQL, Html/CSS Operational research : COIN-OR, Cplex, Boost Graph Library (BGL) Foreign languages English : good References Hervé Kerivin, Assistant Professor, Department of Mathematical Sciences, Clemson University, O-326 Martin Hall, Clemson, SC 29634, USA Tél : kerivin@clemson.edu A. Ridha Mahjoub, Professor, Laboratoire LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, Paris cedex 16 Tél : mahjoub@lamsade.dauphine.fr Alain Quilliot, Professor and director of Laboratoire LIMOS, Université Blaise Pascal, Clermont II, Complexe scientifique des Cézeaux, Aubière, Cedex Tél : alain.quilliot@isima.fr 5
The Multilayer Capacitated Survivable IP Network Design Problem: valid inequalities and Branch-and-Cut
The Multilayer Capacitated Survivable IP Network Design Problem: valid inequalities and Branch-and-Cut S. Borne E. Gourdin O. Klopfenstein A. R. Mahjoub Laboratoire LIPN, UMR CNRS 7030, Institut Galile,
More informationNETWORK SURVIVABILITY AND POLYHEDRAL ANALYSIS
NETWORK SURVIVABILITY AND POLYHEDRAL ANALYSIS A. Ridha Mahjoub LAMSADE, Université Paris-Dauphine, Paris, France Seminar UF Rio de Janeiro, April 9, 204 . Polyhedral techniques Contents.. Polyhedral Approach.2.
More informationMOURAD BAÏOU AND FRANCISCO BARAHONA
THE p-median POLYTOPE OF RESTRICTED Y-GRAPHS MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median
More informationOn the separation of partition inequalities
On the separation of partition inequalities ohamed Didi Biha mohameddidi-biha@univ-avignonfr Ali Ridha ahjoub Ridhaahjoub@mathuniv-bpclermontfr Lise Slama liseslama@isimafr Laboratoire d Analyse non linéaire
More informationThe Integrated Production and Transportation Scheduling Problem based on a GRASP ELS resolution scheme
The Integrated Production and Transportation Scheduling Problem based on a GRASP ELS resolution scheme Marina Vinot, Philippe Lacomme, Aziz Moukrim, Alain Quilliot Université Blaise Pascal LIMOS UMR 6158
More informationEmbedding Formulations, Complexity and Representability for Unions of Convex Sets
, Complexity and Representability for Unions of Convex Sets Juan Pablo Vielma Massachusetts Institute of Technology CMO-BIRS Workshop: Modern Techniques in Discrete Optimization: Mathematics, Algorithms
More informationAn extensive comparison of 0-1 linear programs for the daily satellite mission planning
An extensive comparison of 0-1 linear programs for the daily satellite mission planning Virginie Gabrel Résumé Dans ce papier, nous comparons plusieurs programmes linéaires en variables 0-1 pour résoudre
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More information12.1 Formulation of General Perfect Matching
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope Date: 22/02/2008 Lecturer: Lap Chi Lau Scribe: Yuk Hei Chan, Ling Ding and Xiaobing Wu In this lecture,
More informationA Note on Polyhedral Relaxations for the Maximum Cut Problem
A Note on Polyhedral Relaxations for the Maximum Cut Problem Alantha Newman Abstract We consider three well-studied polyhedral relaxations for the maximum cut problem: the metric polytope of the complete
More information2 The Mixed Postman Problem with Restrictions on the Arcs
Approximation Algorithms for the Mixed Postman Problem with Restrictions on the Arcs Francisco Javier Zaragoza Martínez Departamento de Sistemas, Universidad Autónoma Metropolitana Unidad Azcapotzalco
More informationA Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems Keely L. Croxton Fisher College of Business The Ohio State University Bernard Gendron Département
More informationInteger and Combinatorial Optimization: Clustering Problems
Integer and Combinatorial Optimization: Clustering Problems John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2019 Mitchell Clustering Problems 1 / 14 Clustering Clustering
More informationApproximation of satisfactory bisection problems
Approximation of satisfactory bisection problems Cristina Bazgan a,, Zsolt Tuza b, Daniel Vanderpooten a a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex
More informationBranch-Cut-and-Price solver for Vehicle Routing Problems
1 / 28 Branch-Cut-and-Price solver for Vehicle Routing Problems Ruslan Sadykov 1,2 Issam Tahiri 1,2 François Vanderbeck 2,1 Remi Duclos 1 Artur Pessoa 3 Eduardo Uchoa 3 1 Inria Bordeaux, France 2 Université
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More information6 ROUTING PROBLEMS VEHICLE ROUTING PROBLEMS. Vehicle Routing Problem, VRP:
6 ROUTING PROBLEMS VEHICLE ROUTING PROBLEMS Vehicle Routing Problem, VRP: Customers i=1,...,n with demands of a product must be served using a fleet of vehicles for the deliveries. The vehicles, with given
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationLOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM
LOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM Abstract E.Amaldi, L.Liberti, N.Maculan, F.Maffioli DEI, Politecnico di Milano, I-20133 Milano amaldi,liberti,maculan,maffioli @elet.polimi.it
More informationDesign of Survivable Networks: A Survey
Design of Survivable Networks: A Survey Hervé Kerivin 1 A. Ridha Mahjoub 2 Research Report LIMOS/RR-05-04 3 mars 2005 1 Institute for Mathematics and its Applications, University of Minnesota, 400 Lind
More informationLinear and Integer Programming (ADM II) Script. Rolf Möhring WS 2010/11
Linear and Integer Programming (ADM II) Script Rolf Möhring WS 200/ Contents -. Algorithmic Discrete Mathematics (ADM)... 3... 4.3 Winter term 200/... 5 2. Optimization problems 2. Examples... 7 2.2 Neighborhoods
More informationPolynomial time approximation algorithms
Polynomial time approximation algorithms Doctoral course Optimization on graphs - Lecture 5.2 Giovanni Righini January 18 th, 2013 Approximation algorithms There are several reasons for using approximation
More information7KH9HKLFOH5RXWLQJSUREOHP
7K9KO5RXWJSUREOP Given a set of vehicles with a certain capacity located at a depot and a set of customers with different demands at various locations, the vehicle routing problem (VRP) is how to satisfy
More informationGraph Coloring via Constraint Programming-based Column Generation
Graph Coloring via Constraint Programming-based Column Generation Stefano Gualandi Federico Malucelli Dipartimento di Elettronica e Informatica, Politecnico di Milano Viale Ponzio 24/A, 20133, Milan, Italy
More informationA more efficient algorithm for perfect sorting by reversals
A more efficient algorithm for perfect sorting by reversals Sèverine Bérard 1,2, Cedric Chauve 3,4, and Christophe Paul 5 1 Département de Mathématiques et d Informatique Appliquée, INRA, Toulouse, France.
More informationComplexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs Bruno Escoffier, Laurent Gourvès, Jérôme Monnot To cite this version: Bruno Escoffier, Laurent Gourvès,
More informationGlobal Solution of Mixed-Integer Dynamic Optimization Problems
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 25 Elsevier Science B.V. All rights reserved. Global Solution of Mixed-Integer Dynamic Optimization
More informationTwo-Stage orders sequencing system for mixedmodel
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Two-Stage orders sequencing system for mixedmodel assembly Recent citations - Damian Krenczyk et al To cite this article: M Zemczak
More informationVertical decomposition of a lattice using clique separators
Vertical decomposition of a lattice using clique separators Anne Berry, Romain Pogorelcnik, Alain Sigayret LIMOS UMR CNRS 6158 Ensemble Scientifique des Cézeaux Université Blaise Pascal, F-63 173 Aubière,
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationHeuristic solution methods for the Fiber To The Home cabling problem
Lecture Notes in Management Science (2014) Vol. 6: 198 206 6 th International Conference on Applied Operational Research, Proceedings Tadbir Operational Research Group Ltd. All rights reserved. www.tadbir.ca
More informationStructure of spaces of rhombus tilings in the lexicograhic case
EuroComb 5 DMTCS proc. AE, 5, 45 5 Structure of spaces of rhombus tilings in the lexicograhic case Eric Rémila, Laboratoire de l Informatique du Parallélisme (umr 5668 CNRS-INRIA-Univ. Lyon -ENS Lyon),
More informationTwo models of the capacitated vehicle routing problem
Croatian Operational Research Review 463 CRORR 8(2017), 463 469 Two models of the capacitated vehicle routing problem Zuzana Borčinová 1, 1 Faculty of Management Science and Informatics, University of
More informationDominating Set on Bipartite Graphs
Dominating Set on Bipartite Graphs Mathieu Liedloff Abstract Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationInvestigating Mixed-Integer Hulls using a MIP-Solver
Investigating Mixed-Integer Hulls using a MIP-Solver Matthias Walter Otto-von-Guericke Universität Magdeburg Joint work with Volker Kaibel (OvGU) Aussois Combinatorial Optimization Workshop 2015 Outline
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationDiscrete Optimization
Minisymposium 1 Discrete Optimization Leiter des Symposiums: Prof. Dr. Jens Vygen Prof. Dr. Robert Weismantel Forschungsinstitut für Fakultät für Mathematik / IMO Diskrete Mathematik Universität Bonn Otto-von-Guericke-Universität
More informationApplied Integer Programming
Applied Integer Programming D.S. Chen; R.G. Batson; Y. Dang Fahimeh 8.2 8.7 April 21, 2015 Context 8.2. Convex sets 8.3. Describing a bounded polyhedron 8.4. Describing unbounded polyhedron 8.5. Faces,
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationBranch-and-Cut and GRASP with Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem
Branch-and-Cut and GRASP with Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem Eduardo Uchoa Túlio A.M. Toffolo Mauricio C. de Souza Alexandre X. Martins + Departamento
More informationA simple exact separation algorithm for 2-matching inequalities
A simple exact separation algorithm for 2-matching inequalities Julián Aráoz Simón Bolívar University, Venezuela Technical University of Catalonia, Spain Elena Fernández Technical University of Catalonia,
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationarxiv: v3 [math.co] 9 Jan 2017
SMALLER EXTENDED FORMULATIONS FOR THE SPANNING TREE POLYTOPE OF BOUNDED-GENUS GRAPHS SAMUEL FIORINI, TONY HUYNH, GWENAËL JORET, AND KANSTANTSIN PASHKOVICH arxiv:1604.07976v3 [math.co] 9 Jan 2017 Abstract.
More informationOutline. 1 The matching problem. 2 The Chinese Postman Problem
Outline The matching problem Maximum-cardinality matchings in bipartite graphs Maximum-cardinality matchings in bipartite graphs: The augmenting path algorithm 2 Let G = (V, E) be an undirected graph.
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationComputing and maximizing the exact reliability of wireless backhaul networks
Computing and maximizing the exact reliability of wireless backhaul networks David Coudert, James Luedtke, Eduardo Moreno, Konstantinos Priftis To cite this version: David Coudert, James Luedtke, Eduardo
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationThe ILP approach to the layered graph drawing. Ago Kuusik
The ILP approach to the layered graph drawing Ago Kuusik Veskisilla Teooriapäevad 1-3.10.2004 1 Outline Introduction Hierarchical drawing & Sugiyama algorithm Linear Programming (LP) and Integer Linear
More informationTraffic Grooming in Bidirectional WDM Ring Networks
Traffic Grooming in Bidirectional WDM Ring Networks Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau To cite this version: Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau. Traffic
More informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More informationTowards Efficient Higher-Order Semidefinite Relaxations for Max-Cut
Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Energy Institute Joint work with E. Adams (Poly Mtl), F. Rendl,
More informationA Constraint Programming Based Approach to Detect Ontology Inconsistencies
The International Arab Journal of Information Technology, Vol. 8, No. 1, January 2011 1 A Constraint Programming Based Approach to Detect Ontology Inconsistencies Moussa Benaissa and Yahia Lebbah Faculté
More informationInteger and Combinatorial Optimization
Integer and Combinatorial Optimization GEORGE NEMHAUSER School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, Georgia LAURENCE WOLSEY Center for Operations Research and
More informationPolyhedral Combinatorics (ADM III)
1 Polyhedral Combinatorics (ADM III) Prof. Dr. Dr. h.c. mult. Martin Grötschel Sommersemester 2010, Classes: TU MA 041, Tuesdays 16:15 17:45h, first class on April 13, 2010 LV-Nr.: 3236 L 414 Diese Vorlesung
More informationAlgorithms for Decision Support. Integer linear programming models
Algorithms for Decision Support Integer linear programming models 1 People with reduced mobility (PRM) require assistance when travelling through the airport http://www.schiphol.nl/travellers/atschiphol/informationforpassengerswithreducedmobility.htm
More informationMinimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes
Minimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes J.-F. Couturier 1 P. Heggernes 2 D. Kratsch 1 P. van t Hof 2 1 LITA Université de Lorraine F-57045 Metz France 2 University
More informationLaurent D. COHEN.
for biomedical image segmentation Laurent D. COHEN Directeur de Recherche CNRS CEREMADE, UMR CNRS 7534 Université Paris-9 Dauphine Place du Maréchal de Lattre de Tassigny 75016 Paris, France Cohen@ceremade.dauphine.fr
More informationParameterized Algorithm for Eternal Vertex Cover
Parameterized Algorithm for Eternal Vertex Cover Fedor V. Fomin a,1, Serge Gaspers b, Petr A. Golovach c, Dieter Kratsch d, Saket Saurabh e, a Department of Informatics, University of Bergen, N-5020 Bergen,
More informationA Counterexample to the Dominating Set Conjecture
A Counterexample to the Dominating Set Conjecture Antoine Deza Gabriel Indik November 28, 2005 Abstract The metric polytope met n is the polyhedron associated with all semimetrics on n nodes and defined
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationAn SDP Approach to Multi-level Crossing Minimization
An SDP Approach to Multi-level Crossing Minimization P. Hungerländer joint work with M. Chimani, M. Jünger, P. Mutzel University of Klagenfurt - Department of Mathematics 15th Combinatorial Optimization
More informationREDUCING GRAPH COLORING TO CLIQUE SEARCH
Asia Pacific Journal of Mathematics, Vol. 3, No. 1 (2016), 64-85 ISSN 2357-2205 REDUCING GRAPH COLORING TO CLIQUE SEARCH SÁNDOR SZABÓ AND BOGDÁN ZAVÁLNIJ Institute of Mathematics and Informatics, University
More informationc 2008 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 22, No. 4, pp. 1480 1487 c 2008 Society for Industrial and Applied Mathematics ODD MINIMUM CUT SETS AND b-matchings REVISITED ADAM N. LETCHFORD, GERHARD REINELT, AND DIRK OLIVER
More informationHomework 3 Solutions
CS3510 Design & Analysis of Algorithms Section A Homework 3 Solutions Released: 7pm, Wednesday Nov 8, 2017 This homework has a total of 4 problems on 4 pages. Solutions should be submitted to GradeScope
More informationBranch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows
Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu To cite this version: Estèle Glize, Nicolas Jozefowiez,
More informationAn ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure
MIC2005: The Sixth Metaheuristics International Conference??-1 An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure Xavier Gandibleux Julien
More informationRearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction
Rearrangement of DNA fragments: a branch-and-cut algorithm 1 C. E. Ferreira 1 C. C. de Souza 2 Y. Wakabayashi 1 1 Instituto de Mat. e Estatstica 2 Instituto de Computac~ao Universidade de S~ao Paulo e-mail:
More informationarxiv: v1 [cs.dm] 6 May 2009
Solving the 0 1 Multidimensional Knapsack Problem with Resolution Search Sylvain Boussier a, Michel Vasquez a, Yannick Vimont a, Saïd Hanafi b and Philippe Michelon c arxiv:0905.0848v1 [cs.dm] 6 May 2009
More informationOn Truck dock assignment problem with operational time constraint within cross docks
On Truck dock assignment problem with operational time constraint within cross docks Shahin Gelareh a,b,, Gilles Goncalves a,b, Rahimeh N. Monemi c,1, a UArtois, LGI2A, F-62400, Béthune, France b Univ
More informationA 4-Approximation Algorithm for k-prize Collecting Steiner Tree Problems
arxiv:1802.06564v1 [cs.cc] 19 Feb 2018 A 4-Approximation Algorithm for k-prize Collecting Steiner Tree Problems Yusa Matsuda and Satoshi Takahashi The University of Electro-Communications, Japan February
More informationYour digital resources. in short CIP CENTRE D INGÉNIERIE PÉDAGOGIQUE
Your digital resources CIP CENTRE D INGÉNIERIE PÉDAGOGIQUE in short 2015-2016 MyDauphine MyDauphine is your student access to digital services: current news, events, messages, researching documents, courses
More informationA PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM. 1.
ACTA MATHEMATICA VIETNAMICA Volume 21, Number 1, 1996, pp. 59 67 59 A PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM NGUYEN DINH DAN AND
More informationOn a Cardinality-Constrained Transportation Problem With Market Choice
On a Cardinality-Constrained Transportation Problem With Market Choice Matthias Walter a, Pelin Damcı-Kurt b, Santanu S. Dey c,, Simge Küçükyavuz b a Institut für Mathematische Optimierung, Otto-von-Guericke-Universität
More informationStavros Nikolaou. 413 Gates Hall URL: Ithaca, NY, 14853, USA Date of Birth: December, 1987
413 Gates Hall +1 6073795409 Department of Computer Science Cornell University email: snikolaou@cs.cornell.edu URL: www.cs.cornell.edu/~snikolaou Ithaca, NY, 14853, USA Date of Birth: December, 1987 Education
More informationThe Vertex k-cut Problem
The Vertex k-cut Problem Denis Cornaz 1, Fabio Furini 1, Mathieu Lacroix 2, Enrico Malaguti 3, A. Ridha Mahjoub 1, Sébastien Martin 4 1 PSL, Université Paris Dauphine, CNRS, LAMSADE UMR 7243 75775 Paris
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
More informationCombinatorial Optimization
Combinatorial Optimization MA4502 Michael Ritter This work is licensed under a Creative Commons Attribution- ShareAlike 4.0 International license. last updated July 14, 2015 Contents 1 Introduction and
More informationCutting Planes for Some Nonconvex Combinatorial Optimization Problems
Cutting Planes for Some Nonconvex Combinatorial Optimization Problems Ismael Regis de Farias Jr. Department of Industrial Engineering Texas Tech Summary Problem definition Solution strategy Multiple-choice
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationTHEORY OF LINEAR AND INTEGER PROGRAMMING
THEORY OF LINEAR AND INTEGER PROGRAMMING ALEXANDER SCHRIJVER Centrum voor Wiskunde en Informatica, Amsterdam A Wiley-Inter science Publication JOHN WILEY & SONS^ Chichester New York Weinheim Brisbane Singapore
More informationLower Bounds and Heuristics for the Windy Rural Postman Problem
Lower Bounds and Heuristics for the Windy Rural Postman Problem E. Benavent 1, A. Carrotta 2, A. Corberán 1, J.M. Sanchis 3 and D. Vigo 2 1 D.E.I.O., Universitat de València (Spain) 2 D.E.I.S., University
More informationMinimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks
International Journal of Mathematics And Its Applications Vol.2 No.2(2014), pp.37-46 ISSN: 2347-1557(online) Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks Albert William,
More informationImplementing Scalable Parallel Search Algorithms for Data-Intensive Applications
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications Ted Ralphs Industrial and Systems Engineering Lehigh University http://www.lehigh.edu/~tkr2 Laszlo Ladanyi IBM T.J. Watson
More informationResearch Interests Optimization:
Mitchell: Research interests 1 Research Interests Optimization: looking for the best solution from among a number of candidates. Prototypical optimization problem: min f(x) subject to g(x) 0 x X IR n Here,
More informationCover Inequalities. As mentioned above, the cover inequalities were first presented in the context of the 0-1 KP. The 0-1 KP takes the following form:
Cover Inequalities Konstantinos Kaparis Adam N. Letchford Many problems arising in OR/MS can be formulated as Mixed-Integer Linear Programs (MILPs); see entry #1.4.1.1. If one wishes to solve a class of
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationLagrangian Relaxation as a solution approach to solving the Survivable Multi-Hour Network Design Problem
Lagrangian Relaxation as a solution approach to solving the Survivable Multi-Hour Network Design Problem S.E. Terblanche, R. Wessäly and J.M. Hattingh School of Computer, Statistical and Mathematical Sciences
More informationA column generation algorithm for the team orienteering problem with time windows
A column generation algorithm for the team orienteering problem with time windows Racha El-Hajj, Aziz Moukrim, B Chebaro, M Kobeissi To cite this version: Racha El-Hajj, Aziz Moukrim, B Chebaro, M Kobeissi.
More informationComputational Complexity CSC Professor: Tom Altman. Capacitated Problem
Computational Complexity CSC 5802 Professor: Tom Altman Capacitated Problem Agenda: Definition Example Solution Techniques Implementation Capacitated VRP (CPRV) CVRP is a Vehicle Routing Problem (VRP)
More informationHybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems
Hybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems Fabio Parisini Tutor: Paola Mello Co-tutor: Michela Milano Final seminars of the XXIII cycle of the doctorate
More informationMinimum Weight Constrained Forest Problems. Problem Definition
Slide 1 s Xiaoyun Ji, John E. Mitchell Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY, USA jix@rpi.edu, mitchj@rpi.edu 2005 Optimization Days Montreal, Canada May 09, 2005
More informationEmbedded Subgraph Isomorphism and Related Problems
Embedded Subgraph Isomorphism and Related Problems Graph isomorphism, subgraph isomorphism, and maximum common subgraph can be solved in polynomial time when constrained by geometrical information, in
More informationLecture 14: Linear Programming II
A Theorist s Toolkit (CMU 18-859T, Fall 013) Lecture 14: Linear Programming II October 3, 013 Lecturer: Ryan O Donnell Scribe: Stylianos Despotakis 1 Introduction At a big conference in Wisconsin in 1948
More informationThe Orchard Crossing Number of an Abstract Graph
City University of New York (CUNY) CUNY Academic Works Publications and Research Kingsborough Community College 009 The Orchard Crossing Number of an Abstract Graph Elie Feder CUNY Kingsborough Community
More informationThe Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks
The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks Florian Huc, Claudia Linhares Sales, Hervé Rivano To cite this version: Florian Huc, Claudia Linhares Sales, Hervé Rivano.
More informationFast Marching and Geodesic Methods. Some Applications
Fast Marching and Geodesic Methods. Some Applications Laurent D. COHEN Directeur de Recherche CNRS CEREMADE, UMR CNRS 7534 Université Paris-9 Dauphine Place du Maréchal de Lattre de Tassigny 75016 Paris,
More informationPolyhedral results for the Cardinality Constrained Multi-cycle Problem (CCMcP) and the Cardinality Constrained Cycles and Chains Problem (CCCCP)
1st International Congress on Modelling and Simulation, Gold Coast, Australia, 9 Nov to 4 Dec 015 www.mssanz.org.au/modsim015 Polyhedral results for the Cardinality Constrained Multi-cycle Problem (CCMcP)
More informationA De Bruijn Erdős theorem for chordal graphs
A De Bruijn Erdős theorem for chordal graphs Laurent Beaudou (Université Blaise Pascal, Clermont-Ferrand) 1 Adrian Bondy (Université Paris 6) 2 Xiaomin Chen (Shanghai Jianshi LTD) 3 Ehsan Chiniforooshan
More information