Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations
Identifieur interne : 000447 ( Istex/Corpus ); précédent : 000446; suivant : 000448Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations
Auteurs : Rodrigo Acuna-Agost ; Philippe Michelon ; Dominique Feillet ; Serigne GueyeSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.
Url:
DOI: 10.1007/978-3-642-01929-6_24
Links to Exploration step
ISTEX:E29CCF690B543D3D31748A1F715CD80650AC0F88Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><author><name sortKey="Acuna Agost, Rodrigo" sort="Acuna Agost, Rodrigo" uniqKey="Acuna Agost R" first="Rodrigo" last="Acuna-Agost">Rodrigo Acuna-Agost</name><affiliation><mods:affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rodrigo.acuna-agost@univ-avignon.fr</mods:affiliation></affiliation></author><author><name sortKey="Michelon, Philippe" sort="Michelon, Philippe" uniqKey="Michelon P" first="Philippe" last="Michelon">Philippe Michelon</name><affiliation><mods:affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</mods:affiliation></affiliation></author><author><name sortKey="Feillet, Dominique" sort="Feillet, Dominique" uniqKey="Feillet D" first="Dominique" last="Feillet">Dominique Feillet</name><affiliation><mods:affiliation>Ecole des Mines de Saint-Etienne, F-13541, Gardanne, France</mods:affiliation></affiliation></author><author><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name><affiliation><mods:affiliation>Laboratoire de Mathématiques Appliquées du Havre, F-76058, Le Havre, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E29CCF690B543D3D31748A1F715CD80650AC0F88</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-01929-6_24</idno><idno type="url">https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000447</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><author><name sortKey="Acuna Agost, Rodrigo" sort="Acuna Agost, Rodrigo" uniqKey="Acuna Agost R" first="Rodrigo" last="Acuna-Agost">Rodrigo Acuna-Agost</name><affiliation><mods:affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rodrigo.acuna-agost@univ-avignon.fr</mods:affiliation></affiliation></author><author><name sortKey="Michelon, Philippe" sort="Michelon, Philippe" uniqKey="Michelon P" first="Philippe" last="Michelon">Philippe Michelon</name><affiliation><mods:affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</mods:affiliation></affiliation></author><author><name sortKey="Feillet, Dominique" sort="Feillet, Dominique" uniqKey="Feillet D" first="Dominique" last="Feillet">Dominique Feillet</name><affiliation><mods:affiliation>Ecole des Mines de Saint-Etienne, F-13541, Gardanne, France</mods:affiliation></affiliation></author><author><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name><affiliation><mods:affiliation>Laboratoire de Mathématiques Appliquées du Havre, F-76058, Le Havre, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">E29CCF690B543D3D31748A1F715CD80650AC0F88</idno><idno type="DOI">10.1007/978-3-642-01929-6_24</idno><idno type="ChapterID">24</idno><idno type="ChapterID">Chap24</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Rodrigo Acuna-Agost</name><affiliations><json:string>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</json:string><json:string>E-mail: rodrigo.acuna-agost@univ-avignon.fr</json:string></affiliations></json:item><json:item><name>Philippe Michelon</name><affiliations><json:string>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</json:string></affiliations></json:item><json:item><name>Dominique Feillet</name><affiliations><json:string>Ecole des Mines de Saint-Etienne, F-13541, Gardanne, France</json:string></affiliations></json:item><json:item><name>Serigne Gueye</name><affiliations><json:string>Laboratoire de Mathématiques Appliquées du Havre, F-76058, Le Havre, France</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.</abstract><qualityIndicators><score>3.092</score><pdfVersion>1.6</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>488</abstractCharCount><pdfWordCount>752</pdfWordCount><pdfCharCount>4754</pdfCharCount><pdfPageCount>2</pdfPageCount><abstractWordCount>70</abstractWordCount></qualityIndicators><title>Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><chapterId><json:string>24</json:string><json:string>Chap24</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2009</copyrightDate></serie><host><editor><json:item><name>Willem-Jan van Hoeve</name><affiliations><json:string>Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, PA 15213, Pittsburgh, USA</json:string><json:string>E-mail: vanhoeve@andrew.cmu.edu</json:string></affiliations></json:item><json:item><name>John N. Hooker</name><affiliations><json:string>Carnegie Mellon University,</json:string><json:string>E-mail: john@hooker.tepper.cmu.edu</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Numeric Computing</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Operations Research/Decision Theory</value></json:item><json:item><value>Combinatorics</value></json:item></subject><isbn><json:string>978-3-642-01928-9</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems</title><bookId><json:string>978-3-642-01929-6</json:string></bookId><volume>5547</volume><pages><last>313</last><first>312</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-01929-6</json:string></eisbn><copyrightDate>2009</copyrightDate><doi><json:string>10.1007/978-3-642-01929-6</json:string></doi></host><publicationDate>2009</publicationDate><copyrightDate>2009</copyrightDate><doi><json:string>10.1007/978-3-642-01929-6_24</json:string></doi><id>E29CCF690B543D3D31748A1F715CD80650AC0F88</id><score>0.38013983</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><title level="a" type="sub" xml:lang="en">A Comparative Analysis of Models, Solution Methods,and Their Integration</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer Berlin Heidelberg, 2009</p></availability><date>2009</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><title level="a" type="sub" xml:lang="en">A Comparative Analysis of Models, Solution Methods,and Their Integration</title><author xml:id="author-1"><persName><forename type="first">Rodrigo</forename><surname>Acuna-Agost</surname></persName><email>rodrigo.acuna-agost@univ-avignon.fr</email><affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</affiliation></author><author xml:id="author-2"><persName><forename type="first">Philippe</forename><surname>Michelon</surname></persName><affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</affiliation></author><author xml:id="author-3"><persName><forename type="first">Dominique</forename><surname>Feillet</surname></persName><affiliation>Ecole des Mines de Saint-Etienne, F-13541, Gardanne, France</affiliation></author><author xml:id="author-4"><persName><forename type="first">Serigne</forename><surname>Gueye</surname></persName><affiliation>Laboratoire de Mathématiques Appliquées du Havre, F-76058, Le Havre, France</affiliation></author></analytic><monogr><title level="m">Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems</title><title level="m" type="sub">6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings</title><idno type="pISBN">978-3-642-01928-9</idno><idno type="eISBN">978-3-642-01929-6</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-01929-6</idno><idno type="book-ID">978-3-642-01929-6</idno><idno type="book-title-ID">188764</idno><idno type="book-sequence-number">5547</idno><idno type="book-volume-number">5547</idno><idno type="book-chapter-count">32</idno><editor><persName><forename type="first">Willem-Jan</forename><surname>van Hoeve</surname></persName><email>vanhoeve@andrew.cmu.edu</email><affiliation>Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, PA 15213, Pittsburgh, USA</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">N.</forename><surname>Hooker</surname></persName><email>john@hooker.tepper.cmu.edu</email><affiliation>Carnegie Mellon University,</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2009"></date><biblScope unit="volume">5547</biblScope><biblScope unit="page" from="312">312</biblScope><biblScope unit="page" to="313">313</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2009</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">E29CCF690B543D3D31748A1F715CD80650AC0F88</idno><idno type="DOI">10.1007/978-3-642-01929-6_24</idno><idno type="ChapterID">24</idno><idno type="ChapterID">Chap24</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2009</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I1701X</label><label>I17028</label><label>I16021</label><label>I21017</label><label>W23067</label><label>M17009</label><item><term>Computer Science</term></item><item><term>Numeric Computing</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Operations Research/Decision Theory</term></item><item><term>Combinatorics</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2009">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-09-22">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0" SeriesType="Series"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo Language="En" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0" ContainsESM="No" BookProductType="Proceedings" MediaType="eBook"><BookID>978-3-642-01929-6</BookID><BookTitle>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems</BookTitle><BookSubTitle>6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings</BookSubTitle><BookVolumeNumber>5547</BookVolumeNumber><BookSequenceNumber>5547</BookSequenceNumber><BookDOI>10.1007/978-3-642-01929-6</BookDOI><BookTitleID>188764</BookTitleID><BookPrintISBN>978-3-642-01928-9</BookPrintISBN><BookElectronicISBN>978-3-642-01929-6</BookElectronicISBN><BookChapterCount>32</BookChapterCount><BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2009</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Type="Primary" Code="I">Computer Science</BookSubject><BookSubject Type="Secondary" Priority="1" Code="I1701X">Numeric Computing</BookSubject><BookSubject Type="Secondary" Priority="2" Code="I17028">Discrete Mathematics in Computer Science</BookSubject><BookSubject Type="Secondary" Priority="3" Code="I16021">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Type="Secondary" Priority="4" Code="I21017">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Type="Secondary" Priority="5" Code="W23067">Operations Research/Decision Theory</BookSubject><BookSubject Type="Secondary" Priority="6" Code="M17009">Combinatorics</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Willem-Jan</GivenName><Particle>van</Particle><FamilyName>Hoeve</FamilyName></EditorName><Contact><Email>vanhoeve@andrew.cmu.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>N.</GivenName><FamilyName>Hooker</FamilyName></EditorName><Contact><Email>john@hooker.tepper.cmu.edu</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Tepper School of Business</OrgDivision><OrgName>Carnegie Mellon University</OrgName><OrgAddress><Street>5000 Forbes Avenue</Street><Postcode>PA 15213</Postcode><City>Pittsburgh</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartSequenceNumber>3</PartSequenceNumber><PartTitle>Extended Abstracts</PartTitle><PartChapterCount>10</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems</BookTitle></PartContext></PartInfo><Chapter ID="Chap24" Language="En"><ChapterInfo ChapterType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>24</ChapterID><ChapterDOI>10.1007/978-3-642-01929-6_24</ChapterDOI><ChapterSequenceNumber>24</ChapterSequenceNumber><ChapterTitle Language="En">Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</ChapterTitle><ChapterSubTitle Language="En">A Comparative Analysis of Models, Solution Methods,and Their Integration</ChapterSubTitle><ChapterFirstPage>312</ChapterFirstPage><ChapterLastPage>313</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2009</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>3</PartID><BookID>978-3-642-01929-6</BookID><BookTitle>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Rodrigo</GivenName><FamilyName>Acuna-Agost</FamilyName></AuthorName><Contact><Email>rodrigo.acuna-agost@univ-avignon.fr</Email></Contact></Author><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Philippe</GivenName><FamilyName>Michelon</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Dominique</GivenName><FamilyName>Feillet</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Serigne</GivenName><FamilyName>Gueye</FamilyName></AuthorName></Author><Affiliation ID="Aff18"><OrgDivision>Laboratoire d’Informatique d’Avignon (LIA)</OrgDivision><OrgName>Université d’Avignon et des Pays de Vaucluse</OrgName><OrgAddress><Postcode>F-84911</Postcode><City>Avignon</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgName>Ecole des Mines de Saint-Etienne</OrgName><OrgAddress><Postcode>F-13541</Postcode><City>Gardanne</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgName>Laboratoire de Mathématiques Appliquées du Havre</OrgName><OrgAddress><Postcode>F-76058</Postcode><City>Le Havre</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><subTitle>A Comparative Analysis of Models, Solution Methods,and Their Integration</subTitle></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations</title><subTitle>A Comparative Analysis of Models, Solution Methods,and Their Integration</subTitle></titleInfo><name type="personal"><namePart type="given">Rodrigo</namePart><namePart type="family">Acuna-Agost</namePart><affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</affiliation><affiliation>E-mail: rodrigo.acuna-agost@univ-avignon.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Philippe</namePart><namePart type="family">Michelon</namePart><affiliation>Laboratoire d’Informatique d’Avignon (LIA), Université d’Avignon et des Pays de Vaucluse, F-84911, Avignon, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Dominique</namePart><namePart type="family">Feillet</namePart><affiliation>Ecole des Mines de Saint-Etienne, F-13541, Gardanne, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Serigne</namePart><namePart type="family">Gueye</namePart><affiliation>Laboratoire de Mathématiques Appliquées du Havre, F-76058, Le Havre, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2009</dateIssued><copyrightDate encoding="w3cdtf">2009</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.</abstract><relatedItem type="host"><titleInfo><title>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems</title><subTitle>6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Willem-Jan</namePart><namePart type="family">van Hoeve</namePart><affiliation>Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, PA 15213, Pittsburgh, USA</affiliation><affiliation>E-mail: vanhoeve@andrew.cmu.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">N.</namePart><namePart type="family">Hooker</namePart><affiliation>Carnegie Mellon University</affiliation><affiliation>E-mail: john@hooker.tepper.cmu.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2009</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I1701X">Numeric Computing</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="W23067">Operations Research/Decision Theory</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic></subject><identifier type="DOI">10.1007/978-3-642-01929-6</identifier><identifier type="ISBN">978-3-642-01928-9</identifier><identifier type="eISBN">978-3-642-01929-6</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">188764</identifier><identifier type="BookID">978-3-642-01929-6</identifier><identifier type="BookChapterCount">32</identifier><identifier type="BookVolumeNumber">5547</identifier><identifier type="BookSequenceNumber">5547</identifier><identifier type="PartChapterCount">10</identifier><part><date>2009</date><detail type="part"><title>Extended Abstracts</title></detail><detail type="volume"><number>5547</number><caption>vol.</caption></detail><extent unit="pages"><start>312</start><end>313</end></extent></part><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2009</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2009</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2009</recordOrigin></recordInfo></relatedItem><identifier type="istex">E29CCF690B543D3D31748A1F715CD80650AC0F88</identifier><identifier type="DOI">10.1007/978-3-642-01929-6_24</identifier><identifier type="ChapterID">24</identifier><identifier type="ChapterID">Chap24</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2009</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2009</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/enrichments/multicat</uri></json:item><istex:refBibTEI uri="https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><monogr><title></title><author><persName><forename type="first">R</forename><surname>Acuna-Agost</surname></persName></author><author><persName><forename type="first">S</forename><surname>Gueye</surname></persName></author><imprint><date type="published" when="2006"></date><publisher>Web MAGES</publisher></imprint></monogr></biblStruct><biblStruct xml:id="b1"><monogr><title level="m" type="main">SAPI -Statistical Analysis of Propagation of Incidents. In: A new approach applied to solve the railway rescheduling problem</title><author><persName><forename type="first">R</forename><surname>Acuna-Agost</surname></persName></author><author><persName><forename type="first">D</forename><surname>Feillet</surname></persName></author><author><persName><forename type="first">S</forename><surname>Gueye</surname></persName></author><author><persName><forename type="first">P</forename><surname>Michelon</surname></persName></author><imprint><date type="published" when="2007"></date><pubPlace>Rouen, France</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b2"><monogr><title level="m" type="main">A MIP-based local search method for the railway rescheduling problem</title><author><persName><forename type="first">R</forename><surname>Acuna-Agost</surname></persName></author><author><persName><forename type="first">D</forename><surname>Feillet</surname></persName></author><author><persName><forename type="first">S</forename><surname>Gueye</surname></persName></author><author><persName><forename type="first">P</forename><surname>Michelon</surname></persName></author><imprint><date type="published" when="2009"></date><publisher>LIA</publisher></imprint></monogr></biblStruct><biblStruct xml:id="b3"><monogr><title level="m" type="main">Méthode PLNE pour le réordonnancement de plan de circulation ferroviaire en cas d'incident</title><author><persName><forename type="first">R</forename><surname>Acuna-Agost</surname></persName></author><author><persName><forename type="first">D</forename><surname>Feillet</surname></persName></author><author><persName><forename type="first">S</forename><surname>Gueye</surname></persName></author><author><persName><forename type="first">P</forename><surname>Michelon</surname></persName></author><imprint><date type="published" when="2008"></date><pubPlace>Clermont-Ferrand, France</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">N-tracked railway traffic re-scheduling during disturbances</title><author><persName><forename type="first">J</forename><surname>Tornquist</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Persson</surname></persName></author></analytic><monogr><title level="j">Transportation Research Part B</title><imprint><date type="published" when="2006"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI><json:item><type>refBibs</type><uri>https://api.istex.fr/document/E29CCF690B543D3D31748A1F715CD80650AC0F88/enrichments/refBibs</uri></json:item></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000447 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000447 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E29CCF690B543D3D31748A1F715CD80650AC0F88
|texte= Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations
}}
| This area was generated with Dilib version V0.6.25. |  |