Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Martin W. P. Savelsbergh
@article{DBLP:journals/ejtl/YildizSD23,
author = {Baris Yildiz and
Martin W. P. Savelsbergh and
Ali K. Dogru},
title = {Transshipment network design for express air cargo operations in China},
journal = {{EURO} J. Transp. Logist.},
volume = {12},
pages = {100120},
year = {2023},
url = {https://doi.org/10.1016/j.ejtl.2023.100120},
doi = {10.1016/J.EJTL.2023.100120},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejtl/YildizSD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/WuHSH23,
author = {Haotian Wu and
Ian Herszterg and
Martin W. P. Savelsbergh and
Yixiao Huang},
title = {Service Network Design for Same-Day Delivery with Hub Capacity Constraints},
journal = {Transp. Sci.},
volume = {57},
number = {1},
pages = {273--287},
year = {2023},
url = {https://doi.org/10.1287/trsc.2022.1155},
doi = {10.1287/TRSC.2022.1155},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/WuHSH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BaubaidBS23,
author = {Ahmad Baubaid and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers},
journal = {Transp. Sci.},
volume = {57},
number = {3},
pages = {717--740},
year = {2023},
url = {https://doi.org/10.1287/trsc.2022.1190},
doi = {10.1287/TRSC.2022.1190},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/BaubaidBS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BehrendtSW23,
author = {Adam Behrendt and
Martin W. P. Savelsbergh and
He Wang},
title = {A Prescriptive Machine Learning Method for Courier Scheduling on Crowdsourced
Delivery Platforms},
journal = {Transp. Sci.},
volume = {57},
number = {4},
pages = {889--907},
year = {2023},
url = {https://doi.org/10.1287/trsc.2022.1152},
doi = {10.1287/TRSC.2022.1152},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/BehrendtSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/SavelsberghU22,
author = {Martin W. P. Savelsbergh and
Marlin W. Ulmer},
title = {Challenges and opportunities in crowdsourced delivery planning and
operations},
journal = {4OR},
volume = {20},
number = {1},
pages = {1--21},
year = {2022},
url = {https://doi.org/10.1007/s10288-021-00500-2},
doi = {10.1007/S10288-021-00500-2},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/SavelsberghU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LagosBS22,
author = {Felipe Lagos and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {Dynamic discretization discovery for solving the Continuous Time Inventory
Routing Problem with Out-and-Back Routes},
journal = {Comput. Oper. Res.},
volume = {141},
pages = {105686},
year = {2022},
url = {https://doi.org/10.1016/j.cor.2021.105686},
doi = {10.1016/J.COR.2021.105686},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/LagosBS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/0001S22,
author = {Baris Yildiz and
Martin W. P. Savelsbergh},
title = {Optimizing package express operations in China},
journal = {Eur. J. Oper. Res.},
volume = {300},
number = {1},
pages = {320--335},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.09.035},
doi = {10.1016/J.EJOR.2021.09.035},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/0001S22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YangRBES22,
author = {Yu Yang and
Yassine Ridouane and
Natashia Boland and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {Substitution-based equipment balancing in service networks with multiple
equipment types},
journal = {Eur. J. Oper. Res.},
volume = {300},
number = {3},
pages = {966--978},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.09.005},
doi = {10.1016/J.EJOR.2021.09.005},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YangRBES22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YangBDS22,
author = {Yu Yang and
Natashia Boland and
Bistra Dilkina and
Martin W. P. Savelsbergh},
title = {Learning generalized strong branching for set covering, set packing,
and 0-1 knapsack problems},
journal = {Eur. J. Oper. Res.},
volume = {301},
number = {3},
pages = {828--840},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.11.050},
doi = {10.1016/J.EJOR.2021.11.050},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YangBDS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HersztergRBES22,
author = {Ian Herszterg and
Yassine Ridouane and
Natashia Boland and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {Near real-time loadplan adjustments for less-than-truckload carriers},
journal = {Eur. J. Oper. Res.},
volume = {301},
number = {3},
pages = {1021--1034},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.11.044},
doi = {10.1016/J.EJOR.2021.11.044},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/HersztergRBES22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/HeBNS22,
author = {Edward Yuhang He and
Natashia Boland and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest
Path Problems},
journal = {{INFORMS} J. Comput.},
volume = {34},
number = {2},
pages = {1086--1114},
year = {2022},
url = {https://doi.org/10.1287/ijoc.2021.1084},
doi = {10.1287/IJOC.2021.1084},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/HeBNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/YildizBS22,
author = {Baris Yildiz and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {Decomposition Branching for Mixed Integer Programming},
journal = {Oper. Res.},
volume = {70},
number = {3},
pages = {1854--1872},
year = {2022},
url = {https://doi.org/10.1287/opre.2021.2210},
doi = {10.1287/OPRE.2021.2210},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/YildizBS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HeBNS22,
author = {Edward He and
Natashia Boland and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {An exact algorithm for the service network design problem with hub
capacity constraints},
journal = {Networks},
volume = {80},
number = {4},
pages = {572--596},
year = {2022},
url = {https://doi.org/10.1002/net.22128},
doi = {10.1002/NET.22128},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/HeBNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/UlmerES22,
author = {Marlin W. Ulmer and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {Dynamic service area sizing in urban delivery},
journal = {{OR} Spectr.},
volume = {44},
number = {3},
pages = {763--793},
year = {2022},
url = {https://doi.org/10.1007/s00291-022-00666-z},
doi = {10.1007/S00291-022-00666-Z},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ors/UlmerES22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/MunariS22,
author = {Pedro Munari and
Martin W. P. Savelsbergh},
title = {Compact Formulations for Split Delivery Routing Problems},
journal = {Transp. Sci.},
volume = {56},
number = {4},
pages = {1022--1043},
year = {2022},
url = {https://doi.org/10.1287/trsc.2021.1106},
doi = {10.1287/TRSC.2021.1106},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/MunariS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/WangZSW22,
author = {Yang Wang and
Lei Zhao and
Martin W. P. Savelsbergh and
Shengnan Wu},
title = {Multi-Period Workload Balancing in Last-Mile Urban Delivery},
journal = {Transp. Sci.},
volume = {56},
number = {5},
pages = {1348--1368},
year = {2022},
url = {https://doi.org/10.1287/trsc.2022.1132},
doi = {10.1287/TRSC.2022.1132},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/WangZSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/Grabenschweiger21,
author = {Jasmin Grabenschweiger and
Karl F. Doerner and
Richard F. Hartl and
Martin W. P. Savelsbergh},
title = {The vehicle routing problem with heterogeneous locker boxes},
journal = {Central Eur. J. Oper. Res.},
volume = {29},
number = {1},
pages = {113--142},
year = {2021},
url = {https://doi.org/10.1007/s10100-020-00725-2},
doi = {10.1007/S10100-020-00725-2},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/Grabenschweiger21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AngelelliMSS21,
author = {Enrico Angelelli and
Valentina Morandi and
Martin W. P. Savelsbergh and
Maria Grazia Speranza},
title = {System optimal routing of traffic flows with user constraints using
linear programming},
journal = {Eur. J. Oper. Res.},
volume = {293},
number = {3},
pages = {863--879},
year = {2021},
url = {https://doi.org/10.1016/j.ejor.2020.12.043},
doi = {10.1016/J.EJOR.2020.12.043},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AngelelliMSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/HeBNS21,
author = {Edward He and
Natashia Boland and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Time-Dependent Shortest Path Problems with Penalties and Limits on
Waiting},
journal = {{INFORMS} J. Comput.},
volume = {33},
number = {3},
pages = {997--1014},
year = {2021},
url = {https://doi.org/10.1287/ijoc.2020.0985},
doi = {10.1287/IJOC.2020.0985},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/HeBNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/YangBS21,
author = {Yu Yang and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {Multivariable Branching: {A} 0-1 Knapsack Problem Case Study},
journal = {{INFORMS} J. Comput.},
volume = {33},
number = {4},
pages = {1354--1367},
year = {2021},
url = {https://doi.org/10.1287/ijoc.2020.1052},
doi = {10.1287/IJOC.2020.1052},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/YangBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/Savelsbergh21,
author = {Martin W. P. Savelsbergh},
title = {Thank You and Goodbye},
journal = {Transp. Sci.},
volume = {55},
number = {1},
pages = {1},
year = {2021},
url = {https://doi.org/10.1287/trsc.2020.1037},
doi = {10.1287/TRSC.2020.1037},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/Savelsbergh21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/MarshallBSH21,
author = {Luke Marshall and
Natashia Boland and
Martin W. P. Savelsbergh and
Mike Hewitt},
title = {Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time
Service Network Design Problem},
journal = {Transp. Sci.},
volume = {55},
number = {1},
pages = {29--51},
year = {2021},
url = {https://doi.org/10.1287/trsc.2020.0994},
doi = {10.1287/TRSC.2020.0994},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/MarshallBSH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BaubaidBS21,
author = {Ahmad Baubaid and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {The Value of Limited Flexibility in Service Network Designs},
journal = {Transp. Sci.},
volume = {55},
number = {1},
pages = {52--74},
year = {2021},
url = {https://doi.org/10.1287/trsc.2020.1009},
doi = {10.1287/TRSC.2020.1009},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/BaubaidBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/BelovBSS20,
author = {Gleb Belov and
Natashia L. Boland and
Martin W. P. Savelsbergh and
Peter J. Stuckey},
title = {Logistics optimization for a coal supply chain},
journal = {J. Heuristics},
volume = {26},
number = {2},
pages = {269--300},
year = {2020},
url = {https://doi.org/10.1007/s10732-019-09435-8},
doi = {10.1007/S10732-019-09435-8},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/BelovBSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/PeriniBPS20,
author = {Tyler A. Perini and
Natashia Boland and
Diego Pecin and
Martin W. P. Savelsbergh},
title = {A Criterion Space Method for Biobjective Mixed Integer Programming:
The Boxed Line Method},
journal = {{INFORMS} J. Comput.},
volume = {32},
number = {1},
pages = {16--39},
year = {2020},
url = {https://doi.org/10.1287/ijoc.2019.0887},
doi = {10.1287/IJOC.2019.0887},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/PeriniBPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SampaioSVW20,
author = {Afonso H. Sampaio and
Martin W. P. Savelsbergh and
Lucas P. Veelenturf and
Tom Van Woensel},
title = {Delivery systems with crowd-sourced drivers: {A} pickup and delivery
problem with transfers},
journal = {Networks},
volume = {76},
number = {2},
pages = {232--255},
year = {2020},
url = {https://doi.org/10.1002/net.21963},
doi = {10.1002/NET.21963},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SampaioSVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orf/MunariS20,
author = {Pedro Munari and
Martin W. P. Savelsbergh},
title = {A Column Generation-Based Heuristic for the Split Delivery Vehicle
Routing Problem with Time Windows},
journal = {Oper. Res. Forum},
volume = {1},
number = {4},
year = {2020},
url = {https://doi.org/10.1007/s43069-020-00026-z},
doi = {10.1007/S43069-020-00026-Z},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orf/MunariS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/DayarianSC20,
author = {Iman Dayarian and
Martin W. P. Savelsbergh and
John{-}Paul Clarke},
title = {Same-Day Delivery with Drone Resupply},
journal = {Transp. Sci.},
volume = {54},
number = {1},
pages = {229--249},
year = {2020},
url = {https://doi.org/10.1287/trsc.2019.0944},
doi = {10.1287/TRSC.2019.0944},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/DayarianSC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/LagosBS20,
author = {Felipe Lagos and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {The Continuous-Time Inventory-Routing Problem},
journal = {Transp. Sci.},
volume = {54},
number = {2},
pages = {375--399},
year = {2020},
url = {https://doi.org/10.1287/trsc.2019.0902},
doi = {10.1287/TRSC.2019.0902},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/LagosBS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/VuHBS20,
author = {Duc Minh Vu and
Mike Hewitt and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {Dynamic Discretization Discovery for Solving the Time-Dependent Traveling
Salesman Problem with Time Windows},
journal = {Transp. Sci.},
volume = {54},
number = {3},
pages = {703--720},
year = {2020},
url = {https://doi.org/10.1287/trsc.2019.0911},
doi = {10.1287/TRSC.2019.0911},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/VuHBS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/UlmerS20,
author = {Marlin W. Ulmer and
Martin W. P. Savelsbergh},
title = {Workforce Scheduling in the Era of Crowdsourced Delivery},
journal = {Transp. Sci.},
volume = {54},
number = {4},
pages = {1113--1133},
year = {2020},
url = {https://doi.org/10.1287/trsc.2020.0977},
doi = {10.1287/TRSC.2020.0977},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/UlmerS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/PaulaBEMS19,
author = {Mateus Rocha de Paula and
Natashia Boland and
Andreas T. Ernst and
Alexandre Mendes and
Martin W. P. Savelsbergh},
title = {Throughput optimisation in a coal export system with multiple terminals
and shared resources},
journal = {Comput. Ind. Eng.},
volume = {134},
pages = {37--51},
year = {2019},
url = {https://doi.org/10.1016/j.cie.2019.05.021},
doi = {10.1016/J.CIE.2019.05.021},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/PaulaBEMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/BolandHMS19,
author = {Natashia Boland and
Mike Hewitt and
Luke Marshall and
Martin W. P. Savelsbergh},
title = {The price of discretizing time: a study in service network design},
journal = {{EURO} J. Transp. Logist.},
volume = {8},
number = {2},
pages = {195--216},
year = {2019},
url = {https://doi.org/10.1007/s13676-018-0119-x},
doi = {10.1007/S13676-018-0119-X},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/BolandHMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/SavelsberghT19,
author = {Martin W. P. Savelsbergh and
Masoud Talebian},
title = {Cost allocation under competition: a new rail access charging policy},
journal = {{EURO} J. Transp. Logist.},
volume = {8},
number = {5},
pages = {511--534},
year = {2019},
url = {https://doi.org/10.1007/s13676-018-0133-z},
doi = {10.1007/S13676-018-0133-Z},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/SavelsberghT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BolandCS19,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
title = {Preprocessing and cut generation techniques for multi-objective binary
programming},
journal = {Eur. J. Oper. Res.},
volume = {274},
number = {3},
pages = {858--875},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.10.034},
doi = {10.1016/J.EJOR.2018.10.034},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BolandCS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/Estrada-MorenoS19,
author = {Alejandro Estrada{-}Moreno and
Martin W. P. Savelsbergh and
Angel A. Juan and
Javier Panadero},
title = {Biased-randomized iterated local search for a multiperiod vehicle
routing problem with price discounts for delivery flexibility},
journal = {Int. Trans. Oper. Res.},
volume = {26},
number = {4},
pages = {1293--1314},
year = {2019},
url = {https://doi.org/10.1111/itor.12625},
doi = {10.1111/ITOR.12625},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/Estrada-MorenoS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/YildizS19,
author = {Baris Yildiz and
Martin W. P. Savelsbergh},
title = {Provably High-Quality Solutions for the Meal Delivery Routing Problem},
journal = {Transp. Sci.},
volume = {53},
number = {5},
pages = {1372--1388},
year = {2019},
url = {https://doi.org/10.1287/trsc.2018.0887},
doi = {10.1287/TRSC.2018.0887},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/YildizS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/CharkhgardST18,
author = {Hadi Charkhgard and
Martin W. P. Savelsbergh and
Masoud Talebian},
title = {Nondominated Nash points: application of biobjective mixed integer
programming},
journal = {4OR},
volume = {16},
number = {2},
pages = {151--171},
year = {2018},
url = {https://doi.org/10.1007/s10288-017-0354-2},
doi = {10.1007/S10288-017-0354-2},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/CharkhgardST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/CharkhgardST18,
author = {Hadi Charkhgard and
Martin W. P. Savelsbergh and
Masoud Talebian},
title = {A linear programming based algorithm to solve a class of optimization
problems with a multi-linear objective function and affine constraints},
journal = {Comput. Oper. Res.},
volume = {89},
pages = {17--30},
year = {2018},
url = {https://doi.org/10.1016/j.cor.2017.07.015},
doi = {10.1016/J.COR.2017.07.015},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/CharkhgardST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/StiglicASG18,
author = {Mitja Stiglic and
Niels A. H. Agatz and
Martin W. P. Savelsbergh and
Mirko Gradisar},
title = {Enhancing urban mobility: Integrating ride-sharing and public transit},
journal = {Comput. Oper. Res.},
volume = {90},
pages = {12--21},
year = {2018},
url = {https://doi.org/10.1016/j.cor.2017.08.016},
doi = {10.1016/J.COR.2017.08.016},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/StiglicASG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ReyesES18,
author = {Dami{\'{a}}n Reyes and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {Complexity of routing problems with release dates and deadlines},
journal = {Eur. J. Oper. Res.},
volume = {266},
number = {1},
pages = {29--34},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2017.09.020},
doi = {10.1016/J.EJOR.2017.09.020},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ReyesES18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/CramaRSW18,
author = {Yves Crama and
Mahmood Rezaei and
Martin W. P. Savelsbergh and
Tom Van Woensel},
title = {Stochastic Inventory Routing for Perishable Products},
journal = {Transp. Sci.},
volume = {52},
number = {3},
pages = {526--546},
year = {2018},
url = {https://doi.org/10.1287/trsc.2017.0799},
doi = {10.1287/TRSC.2017.0799},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/CramaRSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/BaubaidBS18,
author = {Ahmad Baubaid and
Natashia Boland and
Martin W. P. Savelsbergh},
editor = {Willem Jan van Hoeve},
title = {Dealing with Demand Uncertainty in Service Network and Load Plan Design},
booktitle = {Integration of Constraint Programming, Artificial Intelligence, and
Operations Research - 15th International Conference, {CPAIOR} 2018,
Delft, The Netherlands, June 26-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10848},
pages = {63--71},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-93031-2\_5},
doi = {10.1007/978-3-319-93031-2\_5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/BaubaidBS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/HeBNS18,
author = {Edward He and
Natashia Boland and
George L. Nemhauser and
Martin W. P. Savelsbergh},
editor = {Willem Jan van Hoeve},
title = {A Dynamic Discretization Discovery Algorithm for the Minimum Duration
Time-Dependent Shortest Path Problem},
booktitle = {Integration of Constraint Programming, Artificial Intelligence, and
Operations Research - 15th International Conference, {CPAIOR} 2018,
Delft, The Netherlands, June 26-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10848},
pages = {289--297},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-93031-2\_21},
doi = {10.1007/978-3-319-93031-2\_21},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpaior/HeBNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-06044,
author = {Mateus Rocha de Paula and
Natashia Boland and
Andreas T. Ernst and
Alexandre Mendes and
Martin W. P. Savelsbergh},
title = {Maximising Throughput in a Complex Coal Export System},
journal = {CoRR},
volume = {abs/1808.06044},
year = {2018},
url = {http://arxiv.org/abs/1808.06044},
eprinttype = {arXiv},
eprint = {1808.06044},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-06044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/LeeS17,
author = {Alan Lee and
Martin W. P. Savelsbergh},
title = {An extended demand responsive connector},
journal = {{EURO} J. Transp. Logist.},
volume = {6},
number = {1},
pages = {25--50},
year = {2017},
url = {https://doi.org/10.1007/s13676-014-0060-6},
doi = {10.1007/S13676-014-0060-6},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/LeeS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ColombiMS17,
author = {Marco Colombi and
Renata Mansini and
Martin W. P. Savelsbergh},
title = {The generalized independent set problem: Polyhedral analysis and solution
approaches},
journal = {Eur. J. Oper. Res.},
volume = {260},
number = {1},
pages = {41--55},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.11.050},
doi = {10.1016/J.EJOR.2016.11.050},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ColombiMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BolandCS17,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
title = {The Quadrant Shrinking Method: {A} simple and efficient algorithm
for solving tri-objective integer programs},
journal = {Eur. J. Oper. Res.},
volume = {260},
number = {3},
pages = {873--885},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.03.035},
doi = {10.1016/J.EJOR.2016.03.035},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BolandCS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BolandCS17a,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
title = {A new method for optimizing a linear function over the efficient set
of a multiobjective integer program},
journal = {Eur. J. Oper. Res.},
volume = {260},
number = {3},
pages = {904--919},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.02.037},
doi = {10.1016/J.EJOR.2016.02.037},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BolandCS17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GuastarobaSS17,
author = {Gianfranco Guastaroba and
Martin W. P. Savelsbergh and
Maria Grazia Speranza},
title = {Adaptive Kernel Search: {A} heuristic for solving Mixed Integer linear
Programs},
journal = {Eur. J. Oper. Res.},
volume = {263},
number = {3},
pages = {789--804},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.06.005},
doi = {10.1016/J.EJOR.2017.06.005},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GuastarobaSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BolandHMS17,
author = {Natashia Boland and
Mike Hewitt and
Luke Marshall and
Martin W. P. Savelsbergh},
title = {The Continuous-Time Service Network Design Problem},
journal = {Oper. Res.},
volume = {65},
number = {5},
pages = {1303--1321},
year = {2017},
url = {https://doi.org/10.1287/opre.2017.1624},
doi = {10.1287/OPRE.2017.1624},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/BolandHMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EngelKS17,
author = {Konrad Engel and
Thomas Kalinowski and
Martin W. P. Savelsbergh},
title = {Incremental Network Design with Minimum Spanning Trees},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {417--432},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00423},
doi = {10.7155/JGAA.00423},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EngelKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KalinowskiKS17,
author = {Thomas Kalinowski and
Reena Kapoor and
Martin W. P. Savelsbergh},
title = {Scheduling reclaimers serving a stock pad at a coal terminal},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {85--101},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0495-8},
doi = {10.1007/S10951-016-0495-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KalinowskiKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/BolandHVS17,
author = {Natashia Boland and
Mike Hewitt and
Duc Minh Vu and
Martin W. P. Savelsbergh},
editor = {Domenico Salvagnin and
Michele Lombardi},
title = {Solving the Traveling Salesman Problem with Time Windows Through Dynamically
Generated Time-Expanded Networks},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
- 14th International Conference, {CPAIOR} 2017, Padua, Italy, June
5-8, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10335},
pages = {254--262},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59776-8\_21},
doi = {10.1007/978-3-319-59776-8\_21},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/BolandHVS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Halvorsen-Weare16,
author = {Elin E. Halvorsen{-}Weare and
Martin W. P. Savelsbergh},
title = {The bi-objective mixed capacitated general routing problem with different
route balance criteria},
journal = {Eur. J. Oper. Res.},
volume = {251},
number = {2},
pages = {451--465},
year = {2016},
url = {https://doi.org/10.1016/j.ejor.2015.11.024},
doi = {10.1016/J.EJOR.2015.11.024},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Halvorsen-Weare16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ArchettiSS16,
author = {Claudia Archetti and
Martin W. P. Savelsbergh and
M. Grazia Speranza},
title = {The Vehicle Routing Problem with Occasional Drivers},
journal = {Eur. J. Oper. Res.},
volume = {254},
number = {2},
pages = {472--480},
year = {2016},
url = {https://doi.org/10.1016/j.ejor.2016.03.049},
doi = {10.1016/J.EJOR.2016.03.049},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ArchettiSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/BolandFMS16,
author = {Natashia Boland and
Matteo Fischetti and
Michele Monaci and
Martin W. P. Savelsbergh},
title = {Proximity Benders: a decomposition heuristic for stochastic programs},
journal = {J. Heuristics},
volume = {22},
number = {2},
pages = {181--198},
year = {2016},
url = {https://doi.org/10.1007/s10732-015-9306-1},
doi = {10.1007/S10732-015-9306-1},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/BolandFMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/BolandCS16,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
title = {The \emph{L}-shape search method for triobjective integer programming},
journal = {Math. Program. Comput.},
volume = {8},
number = {2},
pages = {217--251},
year = {2016},
url = {https://doi.org/10.1007/s12532-015-0093-3},
doi = {10.1007/S12532-015-0093-3},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/BolandCS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AngelelliKKS16,
author = {Enrico Angelelli and
Thomas Kalinowski and
Reena Kapoor and
Martin W. P. Savelsbergh},
title = {A reclaimer scheduling problem arising in coal stockyard management},
journal = {J. Sched.},
volume = {19},
number = {5},
pages = {563--582},
year = {2016},
url = {https://doi.org/10.1007/s10951-015-0436-y},
doi = {10.1007/S10951-015-0436-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AngelelliKKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/Savelsbergh16,
author = {Martin W. P. Savelsbergh},
title = {Editorial - {A} Major Milestone: \emph{Transportation Science} Turns
Fifty},
journal = {Transp. Sci.},
volume = {50},
number = {1},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.1287/trsc.2015.0669},
doi = {10.1287/TRSC.2015.0669},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/Savelsbergh16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/SavelsberghW16,
author = {Martin W. P. Savelsbergh and
Tom Van Woensel},
title = {50th Anniversary Invited Article - City Logistics: Challenges and
Opportunities},
journal = {Transp. Sci.},
volume = {50},
number = {2},
pages = {579--590},
year = {2016},
url = {https://doi.org/10.1287/trsc.2016.0675},
doi = {10.1287/TRSC.2016.0675},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/SavelsberghW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/LindseyES16,
author = {Kathleen Lindsey and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload
Load Plan Design},
journal = {Transp. Sci.},
volume = {50},
number = {4},
pages = {1360--1379},
year = {2016},
url = {https://doi.org/10.1287/trsc.2016.0700},
doi = {10.1287/TRSC.2016.0700},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/LindseyES16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BolandSW15,
author = {Natashia Boland and
Martin W. P. Savelsbergh and
Hamish Waterer},
title = {A decision support tool for generating shipping data for the Hunter
Valley coal chain},
journal = {Comput. Oper. Res.},
volume = {53},
pages = {54--67},
year = {2015},
url = {https://doi.org/10.1016/j.cor.2014.07.016},
doi = {10.1016/J.COR.2014.07.016},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BolandSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/SavelsberghWDM15,
author = {Martin W. P. Savelsbergh and
Hamish Waterer and
Matthew Dall and
Chad Moffiet},
title = {Possession assessment and capacity evaluation of the Central Queensland
Coal Network},
journal = {{EURO} J. Transp. Logist.},
volume = {4},
number = {1},
pages = {139--173},
year = {2015},
url = {https://doi.org/10.1007/s13676-014-0066-0},
doi = {10.1007/S13676-014-0066-0},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/SavelsberghWDM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/SavelsberghS15,
author = {Martin W. P. Savelsbergh and
Olivia J. Smith},
title = {Cargo assembly planning},
journal = {{EURO} J. Transp. Logist.},
volume = {4},
number = {3},
pages = {321--354},
year = {2015},
url = {https://doi.org/10.1007/s13676-014-0048-2},
doi = {10.1007/S13676-014-0048-2},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/SavelsberghS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KalinowskiMS15,
author = {Thomas Kalinowski and
Dmytro Matsypura and
Martin W. P. Savelsbergh},
title = {Incremental network design with maximum flows},
journal = {Eur. J. Oper. Res.},
volume = {242},
number = {1},
pages = {51--62},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2014.10.003},
doi = {10.1016/J.EJOR.2014.10.003},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KalinowskiMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/BolandCS15,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
title = {A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming:
The Triangle Splitting Method},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {4},
pages = {597--618},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2015.0646},
doi = {10.1287/IJOC.2015.0646},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/BolandCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/BolandCS15a,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
title = {A Criterion Space Search Algorithm for Biobjective Integer Programming:
The Balanced Box Method},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {4},
pages = {735--754},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2015.0657},
doi = {10.1287/IJOC.2015.0657},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/BolandCS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/Savelsbergh15,
author = {Martin W. P. Savelsbergh},
title = {Editorial Statement},
journal = {Transp. Sci.},
volume = {49},
number = {2},
pages = {163--164},
year = {2015},
url = {https://doi.org/10.1287/trsc.2015.0585},
doi = {10.1287/TRSC.2015.0585},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/Savelsbergh15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/BenjaafarS14,
author = {Saif Benjaafar and
Martin W. P. Savelsbergh},
title = {Carbon-aware transport and logistics},
journal = {{EURO} J. Transp. Logist.},
volume = {3},
number = {1},
pages = {1--3},
year = {2014},
url = {https://doi.org/10.1007/s13676-014-0049-1},
doi = {10.1007/S13676-014-0049-1},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/BenjaafarS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/TalebianBS14,
author = {Masoud Talebian and
Natashia Boland and
Martin W. P. Savelsbergh},
title = {Pricing to accelerate demand learning in dynamic assortment planning
for perishable products},
journal = {Eur. J. Oper. Res.},
volume = {237},
number = {2},
pages = {555--565},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2014.01.045},
doi = {10.1016/J.EJOR.2014.01.045},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/TalebianBS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BaxterEEKS14,
author = {Matthew Baxter and
Tarek Elgindy and
Andreas T. Ernst and
Thomas Kalinowski and
Martin W. P. Savelsbergh},
title = {Incremental network design with shortest paths},
journal = {Eur. J. Oper. Res.},
volume = {238},
number = {3},
pages = {675--684},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2014.04.018},
doi = {10.1016/J.EJOR.2014.04.018},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BaxterEEKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/BolandEEFST14,
author = {Natashia L. Boland and
Andrew C. Eberhard and
Faramroze G. Engineer and
Matteo Fischetti and
Martin W. P. Savelsbergh and
Angelos Tsoukalas},
title = {Boosting the feasibility pump},
journal = {Math. Program. Comput.},
volume = {6},
number = {3},
pages = {255--279},
year = {2014},
url = {https://doi.org/10.1007/s12532-014-0068-9},
doi = {10.1007/S12532-014-0068-9},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mpc/BolandEEFST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmithS14,
author = {Olivia J. Smith and
Martin W. P. Savelsbergh},
title = {A note on shortest path problems with forbidden paths},
journal = {Networks},
volume = {63},
number = {3},
pages = {239--242},
year = {2014},
url = {https://doi.org/10.1002/net.21541},
doi = {10.1002/NET.21541},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/SmithS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/BelovBSS14,
author = {Gleb Belov and
Natashia Boland and
Martin W. P. Savelsbergh and
Peter J. Stuckey},
editor = {Helmut Simonis},
title = {Local Search for a Cargo Assembly Planning Problem},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
- 11th International Conference, {CPAIOR} 2014, Cork, Ireland, May
19-23, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8451},
pages = {159--175},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07046-9\_12},
doi = {10.1007/978-3-319-07046-9\_12},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/BelovBSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BolandCS14,
author = {Natashia Boland and
Hadi Charkhgard and
Martin W. P. Savelsbergh},
editor = {Jon Lee and
Jens Vygen},
title = {The Triangle Splitting Method for Biobjective Mixed Integer Programming},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {162--173},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_14},
doi = {10.1007/978-3-319-07557-0\_14},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BolandCS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngelelliKKS14,
author = {Enrico Angelelli and
Thomas Kalinowski and
Reena Kapoor and
Martin W. P. Savelsbergh},
title = {Reclaimer Scheduling: Complexity and Algorithms},
journal = {CoRR},
volume = {abs/1402.4178},
year = {2014},
url = {http://arxiv.org/abs/1402.4178},
eprinttype = {arXiv},
eprint = {1402.4178},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AngelelliKKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/CarbajalES13,
author = {Jos{\'{e}} Antonio Carbajal and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {Balancing fleet size and repositioning costs in {LTL} trucking},
journal = {Ann. Oper. Res.},
volume = {203},
number = {1},
pages = {235--254},
year = {2013},
url = {https://doi.org/10.1007/s10479-011-0924-1},
doi = {10.1007/S10479-011-0924-1},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/CarbajalES13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/EreraHSZ13,
author = {Alan L. Erera and
Michael Hewitt and
Martin W. P. Savelsbergh and
Yang Zhang},
title = {Creating schedules and computing operating costs for {LTL} load plans},
journal = {Comput. Oper. Res.},
volume = {40},
number = {3},
pages = {691--702},
year = {2013},
url = {https://doi.org/10.1016/j.cor.2011.10.001},
doi = {10.1016/J.COR.2011.10.001},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/EreraHSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/HewittNSS13,
author = {Mike Hewitt and
George L. Nemhauser and
Martin W. P. Savelsbergh and
Jin{-}Hwa Song},
title = {A branch-and-price guided search approach to maritime inventory routing},
journal = {Comput. Oper. Res.},
volume = {40},
number = {5},
pages = {1410--1419},
year = {2013},
url = {https://doi.org/10.1016/j.cor.2012.09.010},
doi = {10.1016/J.COR.2012.09.010},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/HewittNSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/GuzelsoyNS13,
author = {Menal Guzelsoy and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Restrict-and-relax search for 0-1 mixed-integer programs},
journal = {{EURO} J. Comput. Optim.},
volume = {1},
number = {1-2},
pages = {201--218},
year = {2013},
url = {https://doi.org/10.1007/s13675-013-0007-y},
doi = {10.1007/S13675-013-0007-Y},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejco/GuzelsoyNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/LindseyES13,
author = {Kathleen Lindsey and
Alan L. Erera and
Martin W. P. Savelsbergh},
title = {A pickup and delivery problem using crossdocks and truckload lane
rates},
journal = {{EURO} J. Transp. Logist.},
volume = {2},
number = {1-2},
pages = {5--27},
year = {2013},
url = {https://doi.org/10.1007/s13676-012-0013-x},
doi = {10.1007/S13676-012-0013-X},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/LindseyES13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/HewittNS13,
author = {Mike Hewitt and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Branch-and-Price Guided Search for Integer Programs with an Application
to the Multicommodity Fixed-Charge Network Flow Problem},
journal = {{INFORMS} J. Comput.},
volume = {25},
number = {2},
pages = {302--316},
year = {2013},
url = {https://doi.org/10.1287/ijoc.1120.0503},
doi = {10.1287/IJOC.1120.0503},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/HewittNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/OzenerES13,
author = {Okan {\"{O}}rsan {\"{O}}zener and
{\"{O}}zlem Ergun and
Martin W. P. Savelsbergh},
title = {Allocating Cost of Service to Customers in Inventory Routing},
journal = {Oper. Res.},
volume = {61},
number = {1},
pages = {112--125},
year = {2013},
url = {https://doi.org/10.1287/opre.1120.1130},
doi = {10.1287/OPRE.1120.1130},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/OzenerES13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/EreraHSZ13,
author = {Alan L. Erera and
Michael Hewitt and
Martin W. P. Savelsbergh and
Yang Zhang},
title = {Improved Load Plan Design Through Integer Programming Based Local
Search},
journal = {Transp. Sci.},
volume = {47},
number = {3},
pages = {412--427},
year = {2013},
url = {https://doi.org/10.1287/trsc.1120.0441},
doi = {10.1287/TRSC.1120.0441},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/EreraHSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EngelKS13,
author = {Konrad Engel and
Thomas Kalinowski and
Martin W. P. Savelsbergh},
title = {Incremental Network Design with Minimum Spanning Trees},
journal = {CoRR},
volume = {abs/1306.1926},
year = {2013},
url = {http://arxiv.org/abs/1306.1926},
eprinttype = {arXiv},
eprint = {1306.1926},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EngelKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KalinowskiMS13,
author = {Thomas Kalinowski and
Dmytro Matsypura and
Martin W. P. Savelsbergh},
title = {Incremental Network Design with Maximum Flows},
journal = {CoRR},
volume = {abs/1312.6447},
year = {2013},
url = {http://arxiv.org/abs/1312.6447},
eprinttype = {arXiv},
eprint = {1312.6447},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KalinowskiMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GoelAS12,
author = {Asvin Goel and
Claudia Archetti and
Martin W. P. Savelsbergh},
title = {Truck driver scheduling in Australia},
journal = {Comput. Oper. Res.},
volume = {39},
number = {5},
pages = {1122--1132},
year = {2012},
url = {https://doi.org/10.1016/j.cor.2011.05.021},
doi = {10.1016/J.COR.2011.05.021},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/GoelAS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LiNS12,
author = {Yaxian Li and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Pricing for production and delivery flexibility in single-item lot-sizing},
journal = {Comput. Oper. Res.},
volume = {39},
number = {12},
pages = {3408--3419},
year = {2012},
url = {https://doi.org/10.1016/j.cor.2012.05.003},
doi = {10.1016/J.COR.2012.05.003},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LiNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/BolandGS12,
author = {Natashia Boland and
Damon Gulczynski and
Martin W. P. Savelsbergh},
title = {A stockyard planning problem},
journal = {{EURO} J. Transp. Logist.},
volume = {1},
number = {3},
pages = {197--236},
year = {2012},
url = {https://doi.org/10.1007/s13676-012-0011-z},
doi = {10.1007/S13676-012-0011-Z},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejtl/BolandGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AgatzESW12,
author = {Niels A. H. Agatz and
Alan L. Erera and
Martin W. P. Savelsbergh and
Xing Wang},
title = {Optimization for dynamic ride-sharing: {A} review},
journal = {Eur. J. Oper. Res.},
volume = {223},
number = {2},
pages = {295--303},
year = {2012},
url = {https://doi.org/10.1016/j.ejor.2012.05.028},
doi = {10.1016/J.EJOR.2012.05.028},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AgatzESW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/EngineerNSS12,
author = {Faramroze G. Engineer and
George L. Nemhauser and
Martin W. P. Savelsbergh and
Jin{-}Hwa Song},
title = {The Fixed-Charge Shortest-Path Problem},
journal = {{INFORMS} J. Comput.},
volume = {24},
number = {4},
pages = {578--596},
year = {2012},
url = {https://doi.org/10.1287/ijoc.1110.0469},
doi = {10.1287/IJOC.1110.0469},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/EngineerNSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/EngineerFNSS12,
author = {Faramroze G. Engineer and
Kevin C. Furman and
George L. Nemhauser and
Martin W. P. Savelsbergh and
Jin{-}Hwa Song},
title = {A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory
Routing},
journal = {Oper. Res.},
volume = {60},
number = {1},
pages = {106--122},
year = {2012},
url = {https://doi.org/10.1287/opre.1110.0997},
doi = {10.1287/OPRE.1110.0997},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/EngineerFNSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/PapageorgiouTNS12,
author = {Dimitri J. Papageorgiou and
Alejandro Toriello and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Fixed-Charge Transportation with Product Blending},
journal = {Transp. Sci.},
volume = {46},
number = {2},
pages = {281--295},
year = {2012},
url = {https://doi.org/10.1287/trsc.1110.0381},
doi = {10.1287/TRSC.1110.0381},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/PapageorgiouTNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/HewittNS12,
author = {Mike Hewitt and
George L. Nemhauser and
Martin W. P. Savelsbergh},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Branch-and-Price Guided Search - (Extended Abstract)},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {15--18},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_2},
doi = {10.1007/978-3-642-32147-4\_2},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/HewittNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/EngineerNS11,
author = {Faramroze G. Engineer and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Dynamic Programming-Based Column Generation on Time-Expanded Networks:
Application to the Dial-a-Flight Problem},
journal = {{INFORMS} J. Comput.},
volume = {23},
number = {1},
pages = {105--119},
year = {2011},
url = {https://doi.org/10.1287/ijoc.1100.0384},
doi = {10.1287/IJOC.1100.0384},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/EngineerNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/OzenerES11,
author = {Okan {\"{O}}rsan {\"{O}}zener and
{\"{O}}zlem Ergun and
Martin W. P. Savelsbergh},
title = {Lane-Exchange Mechanisms for Truckload Carrier Collaboration},
journal = {Transp. Sci.},
volume = {45},
number = {1},
pages = {1--17},
year = {2011},
url = {https://doi.org/10.1287/trsc.1100.0327},
doi = {10.1287/TRSC.1100.0327},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/OzenerES11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/AgatzCFS11,
author = {Niels A. H. Agatz and
Ann Melissa Campbell and
Moritz Fleischmann and
Martin W. P. Savelsbergh},
title = {Time Slot Management in Attended Home Delivery},
journal = {Transp. Sci.},
volume = {45},
number = {3},
pages = {435--449},
year = {2011},
url = {https://doi.org/10.1287/trsc.1100.0346},
doi = {10.1287/TRSC.1100.0346},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/AgatzCFS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HemmelmayrDHS10,
author = {Vera C. Hemmelmayr and
Karl F. Doerner and
Richard F. Hartl and
Martin W. P. Savelsbergh},
title = {Vendor managed inventory for environments with stochastic product
usage},
journal = {Eur. J. Oper. Res.},
volume = {202},
number = {3},
pages = {686--695},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2009.06.003},
doi = {10.1016/J.EJOR.2009.06.003},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HemmelmayrDHS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/HewittNS10,
author = {Mike Hewitt and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge
Network Flow Problem},
journal = {{INFORMS} J. Comput.},
volume = {22},
number = {2},
pages = {314--325},
year = {2010},
url = {https://doi.org/10.1287/ijoc.1090.0348},
doi = {10.1287/IJOC.1090.0348},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/HewittNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AhmedGSCFS10,
author = {Shabbir Ahmed and
Ozan Gozbasi and
Martin W. P. Savelsbergh and
Ian Crocker and
Tim Fox and
Eduard Schreibmann},
title = {An Automated Intensity-Modulated Radiation Therapy Planning System},
journal = {{INFORMS} J. Comput.},
volume = {22},
number = {4},
pages = {568--583},
year = {2010},
url = {https://doi.org/10.1287/ijoc.1090.0374},
doi = {10.1287/IJOC.1090.0374},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AhmedGSCFS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/KeysanNS10,
author = {Gizem Keysan and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Tactical and Operational Planning of Scheduled Maintenance for Per-Seat,
On-Demand Air Transportation},
journal = {Transp. Sci.},
volume = {44},
number = {3},
pages = {291--306},
year = {2010},
url = {https://doi.org/10.1287/trsc.1090.0311},
doi = {10.1287/TRSC.1090.0311},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/KeysanNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/EreraMS10,
author = {Alan L. Erera and
Juan Carlos Morales and
Martin W. P. Savelsbergh},
title = {The Vehicle Routing Problem with Stochastic Demand and Duration Constraints},
journal = {Transp. Sci.},
volume = {44},
number = {4},
pages = {474--492},
year = {2010},
url = {https://doi.org/10.1287/trsc.1100.0324},
doi = {10.1287/TRSC.1100.0324},
timestamp = {Wed, 11 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/EreraMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/EreraMS09,
author = {Alan L. Erera and
Juan Carlos Morales and
Martin W. P. Savelsbergh},
title = {Robust Optimization for Empty Repositioning Problems},
journal = {Oper. Res.},
volume = {57},
number = {2},
pages = {468--483},
year = {2009},
url = {https://doi.org/10.1287/opre.1080.0650},
doi = {10.1287/OPRE.1080.0650},
timestamp = {Wed, 11 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/EreraMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/Kilinc-KarzanNS09,
author = {Fatma Kilin{\c{c}}{-}Karzan and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Information-based branching schemes for binary linear mixed integer
problems},
journal = {Math. Program. Comput.},
volume = {1},
number = {4},
pages = {249--293},
year = {2009},
url = {https://doi.org/10.1007/s12532-009-0009-1},
doi = {10.1007/S12532-009-0009-1},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/Kilinc-KarzanNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EreraS09,
author = {Alan L. Erera and
Martin W. P. Savelsbergh},
title = {{ROUTE} 2007: Recent advances in vehicle routing optimization},
journal = {Networks},
volume = {54},
number = {4},
pages = {165--166},
year = {2009},
url = {https://doi.org/10.1002/net.20329},
doi = {10.1002/NET.20329},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EreraS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EreraSU09,
author = {Alan L. Erera and
Martin W. P. Savelsbergh and
Emrah Uyar},
title = {Fixed routes with backup vehicles for stochastic vehicle routing problems
with time constraints},
journal = {Networks},
volume = {54},
number = {4},
pages = {270--283},
year = {2009},
url = {https://doi.org/10.1002/net.20338},
doi = {10.1002/NET.20338},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EreraSU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kilinc-KarzanTANS09,
author = {Fatma Kilin{\c{c}}{-}Karzan and
Alejandro Toriello and
Shabbir Ahmed and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Approximating the stability region for binary mixed-integer programs},
journal = {Oper. Res. Lett.},
volume = {37},
number = {4},
pages = {250--254},
year = {2009},
url = {https://doi.org/10.1016/j.orl.2009.04.001},
doi = {10.1016/J.ORL.2009.04.001},
timestamp = {Mon, 01 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kilinc-KarzanTANS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/HemmelmayrDHS09,
author = {Vera C. Hemmelmayr and
Karl F. Doerner and
Richard F. Hartl and
Martin W. P. Savelsbergh},
title = {Delivery strategies for blood products supplies},
journal = {{OR} Spectr.},
volume = {31},
number = {4},
pages = {707--725},
year = {2009},
url = {https://doi.org/10.1007/s00291-008-0134-7},
doi = {10.1007/S00291-008-0134-7},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ors/HemmelmayrDHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/SchmidDHSS09,
author = {Verena Schmid and
Karl F. Doerner and
Richard F. Hartl and
Martin W. P. Savelsbergh and
Wolfgang Stoecher},
title = {A Hybrid Solution Approach for Ready-Mixed Concrete Delivery},
journal = {Transp. Sci.},
volume = {43},
number = {1},
pages = {70--85},
year = {2009},
url = {https://doi.org/10.1287/trsc.1080.0249},
doi = {10.1287/TRSC.1080.0249},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/SchmidDHSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/ArchettiS09,
author = {Claudia Archetti and
Martin W. P. Savelsbergh},
title = {The Trip Scheduling Problem},
journal = {Transp. Sci.},
volume = {43},
number = {4},
pages = {417--431},
year = {2009},
url = {https://doi.org/10.1287/trsc.1090.0278},
doi = {10.1287/TRSC.1090.0278},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/ArchettiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/opt/Savelsbergh09,
author = {Martin W. P. Savelsbergh},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {Branch and Price: Integer Programming with Column Generation},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {328--332},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_58},
doi = {10.1007/978-0-387-74759-0\_58},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/opt/Savelsbergh09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/NemhauserHS09,
author = {George L. Nemhauser and
Mike Hewitt and
Martin W. P. Savelsbergh},
editor = {Cynthia Barnhart and
Uwe Clausen and
Ulrich Lauther and
Rolf H. M{\"{o}}hring},
title = {Using Branch-and-Price to Find High Quality Solutions Quickly},
booktitle = {Models and Algorithms for Optimization in Logistics, 21.06. - 26.06.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09261},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2168/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/NemhauserHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/SavelsberghS08,
author = {Martin W. P. Savelsbergh and
Jin{-}Hwa Song},
title = {An optimization algorithm for the inventory routing problem with continuous
moves},
journal = {Comput. Oper. Res.},
volume = {35},
number = {7},
pages = {2266--2282},
year = {2008},
url = {https://doi.org/10.1016/j.cor.2006.10.020},
doi = {10.1016/J.COR.2006.10.020},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/SavelsberghS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/EreraKS08,
author = {Alan L. Erera and
Burak Karacik and
Martin W. P. Savelsbergh},
title = {A dynamic driver management scheme for less-than-truckload carriers},
journal = {Comput. Oper. Res.},
volume = {35},
number = {11},
pages = {3397--3411},
year = {2008},
url = {https://doi.org/10.1016/j.cor.2007.01.019},
doi = {10.1016/J.COR.2007.01.019},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/EreraKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HardinNS08,
author = {Jill R. Hardin and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Strong valid inequalities for the resource-constrained scheduling
problem with uniform resource requirements},
journal = {Discret. Optim.},
volume = {5},
number = {1},
pages = {19--35},
year = {2008},
url = {https://doi.org/10.1016/j.disopt.2007.10.003},
doi = {10.1016/J.DISOPT.2007.10.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/HardinNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/ArchettiSS08,
author = {Claudia Archetti and
Maria Grazia Speranza and
Martin W. P. Savelsbergh},
title = {An Optimization-Based Heuristic for the Split Delivery Vehicle Routing
Problem},
journal = {Transp. Sci.},
volume = {42},
number = {1},
pages = {22--31},
year = {2008},
url = {https://doi.org/10.1287/trsc.1070.0204},
doi = {10.1287/TRSC.1070.0204},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/ArchettiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/EspinozaGGNS08,
author = {Daniel G. Espinoza and
Renan Garcia and
Marcos Goycoolea and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Per-Seat, On-Demand Air Transportation Part {I:} Problem Description
and an Integer Multicommodity Flow Model},
journal = {Transp. Sci.},
volume = {42},
number = {3},
pages = {263--278},
year = {2008},
url = {https://doi.org/10.1287/trsc.1070.0227},
doi = {10.1287/TRSC.1070.0227},
timestamp = {Fri, 17 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/EspinozaGGNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/EspinozaGGNS08a,
author = {Daniel G. Espinoza and
Renan Garcia and
Marcos Goycoolea and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Per-Seat, On-Demand Air Transportation Part {II:} Parallel Local Search},
journal = {Transp. Sci.},
volume = {42},
number = {3},
pages = {279--291},
year = {2008},
url = {https://doi.org/10.1287/trsc.1070.0228},
doi = {10.1287/TRSC.1070.0228},
timestamp = {Fri, 17 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/EspinozaGGNS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ErgunKS07,
author = {{\"{O}}zlem Ergun and
G{\"{u}}ltekin Kuyzu and
Martin W. P. Savelsbergh},
title = {Shipper collaboration},
journal = {Comput. Oper. Res.},
volume = {34},
number = {6},
pages = {1551--1560},
year = {2007},
url = {https://doi.org/10.1016/j.cor.2005.07.026},
doi = {10.1016/J.COR.2005.07.026},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/ErgunKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/HardinNS07,
author = {Jill R. Hardin and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Analysis of bounds for a capacitated single-item lot-sizing problem},
journal = {Comput. Oper. Res.},
volume = {34},
number = {6},
pages = {1721--1743},
year = {2007},
url = {https://doi.org/10.1016/j.cor.2005.05.031},
doi = {10.1016/J.COR.2005.05.031},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/HardinNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/SavelsberghS07,
author = {Martin W. P. Savelsbergh and
Jin{-}Hwa Song},
title = {Inventory routing with continuous moves},
journal = {Comput. Oper. Res.},
volume = {34},
number = {6},
pages = {1744--1763},
year = {2007},
url = {https://doi.org/10.1016/j.cor.2005.05.036},
doi = {10.1016/J.COR.2005.05.036},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/SavelsberghS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AngelelliSS07,
author = {Enrico Angelelli and
Maria Grazia Speranza and
Martin W. P. Savelsbergh},
title = {Competitive analysis for dynamic multiperiod uncapacitated routing
problems},
journal = {Networks},
volume = {49},
number = {4},
pages = {308--317},
year = {2007},
url = {https://doi.org/10.1002/net.20180},
doi = {10.1002/NET.20180},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/AngelelliSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AngelelliSS07,
author = {Enrico Angelelli and
Martin W. P. Savelsbergh and
Maria Grazia Speranza},
title = {Competitive analysis of a dispatch policy for a dynamic multi-period
routing problem},
journal = {Oper. Res. Lett.},
volume = {35},
number = {6},
pages = {713--721},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2007.02.006},
doi = {10.1016/J.ORL.2007.02.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/AngelelliSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/SongS07,
author = {Jin{-}Hwa Song and
Martin W. P. Savelsbergh},
title = {Performance Measurement for Inventory Routing},
journal = {Transp. Sci.},
volume = {41},
number = {1},
pages = {44--54},
year = {2007},
url = {https://doi.org/10.1287/trsc.1060.0175},
doi = {10.1287/TRSC.1060.0175},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/SongS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/ErgunKS07,
author = {{\"{O}}zlem Ergun and
G{\"{u}}ltekin Kuyzu and
Martin W. P. Savelsbergh},
title = {Reducing Truckload Transportation Costs Through Collaboration},
journal = {Transp. Sci.},
volume = {41},
number = {2},
pages = {206--221},
year = {2007},
url = {https://doi.org/10.1287/trsc.1060.0169},
doi = {10.1287/TRSC.1060.0169},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/ErgunKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/07/CordeauLSV07,
author = {Jean{-}Fran{\c{c}}ois Cordeau and
Gilbert Laporte and
Martin W. P. Savelsbergh and
Daniele Vigo},
editor = {Cynthia Barnhart and
Gilbert Laporte},
title = {Chapter 6 Vehicle Routing},
booktitle = {Transportation},
series = {Handbooks in Operations Research and Management Science},
volume = {14},
pages = {367--428},
publisher = {Elsevier},
year = {2007},
url = {https://doi.org/10.1016/s0927-0507(06)14006-2},
doi = {10.1016/S0927-0507(06)14006-2},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/07/CordeauLSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/07/CordeauLPS07,
author = {Jean{-}Fran{\c{c}}ois Cordeau and
Gilbert Laporte and
Jean{-}Yves Potvin and
Martin W. P. Savelsbergh},
editor = {Cynthia Barnhart and
Gilbert Laporte},
title = {Chapter 7 Transportation on Demand},
booktitle = {Transportation},
series = {Handbooks in Operations Research and Management Science},
volume = {14},
pages = {429--466},
publisher = {Elsevier},
year = {2007},
url = {https://doi.org/10.1016/s0927-0507(06)14007-4},
doi = {10.1016/S0927-0507(06)14007-4},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/07/CordeauLPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/VanderbeckS06,
author = {Fran{\c{c}}ois Vanderbeck and
Martin W. P. Savelsbergh},
title = {A generic view of Dantzig-Wolfe decomposition in mixed integer programming},
journal = {Oper. Res. Lett.},
volume = {34},
number = {3},
pages = {296--306},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.05.009},
doi = {10.1016/J.ORL.2005.05.009},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/VanderbeckS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/ArchettiSS06,
author = {Claudia Archetti and
Martin W. P. Savelsbergh and
Maria Grazia Speranza},
title = {Worst-Case Analysis for Split Delivery Vehicle Routing Problems},
journal = {Transp. Sci.},
volume = {40},
number = {2},
pages = {226--234},
year = {2006},
url = {https://doi.org/10.1287/trsc.1050.0117},
doi = {10.1287/TRSC.1050.0117},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/ArchettiSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/CampbellS06,
author = {Ann Melissa Campbell and
Martin W. P. Savelsbergh},
title = {Incentive Schemes for Attended Home Delivery Services},
journal = {Transp. Sci.},
volume = {40},
number = {3},
pages = {327--341},
year = {2006},
url = {https://doi.org/10.1287/trsc.1050.0136},
doi = {10.1287/TRSC.1050.0136},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/CampbellS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/AtamturkS05,
author = {Alper Atamt{\"{u}}rk and
Martin W. P. Savelsbergh},
title = {Integer-Programming Software Systems},
journal = {Ann. Oper. Res.},
volume = {140},
number = {1},
pages = {67--124},
year = {2005},
url = {https://doi.org/10.1007/s10479-005-3968-2},
doi = {10.1007/S10479-005-3968-2},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/AtamturkS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/SavelsberghUW05,
author = {Martin W. P. Savelsbergh and
R. N. Uma and
Joel Wein},
title = {An Experimental Study of LP-Based Approximation Algorithms for Scheduling
Problems},
journal = {{INFORMS} J. Comput.},
volume = {17},
number = {1},
pages = {123--136},
year = {2005},
url = {https://doi.org/10.1287/ijoc.1030.0055},
doi = {10.1287/IJOC.1030.0055},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/SavelsberghUW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/VisKS05,
author = {Iris F. A. Vis and
Ren{\'{e}} M. B. M. de Koster and
Martin W. P. Savelsbergh},
title = {Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container
Terminal},
journal = {Transp. Sci.},
volume = {39},
number = {2},
pages = {249--260},
year = {2005},
url = {https://doi.org/10.1287/trsc.1030.0063},
doi = {10.1287/TRSC.1030.0063},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/VisKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/CampbellS05,
author = {Ann Melissa Campbell and
Martin W. P. Savelsbergh},
title = {Decision Support for Consumer Direct Grocery Initiatives},
journal = {Transp. Sci.},
volume = {39},
number = {3},
pages = {313--327},
year = {2005},
url = {https://doi.org/10.1287/trsc.1040.0105},
doi = {10.1287/TRSC.1040.0105},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/CampbellS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/KleywegtNS04,
author = {Anton J. Kleywegt and
Vijay S. Nori and
Martin W. P. Savelsbergh},
title = {Dynamic Programming Approximations for a Stochastic Inventory Routing
Problem},
journal = {Transp. Sci.},
volume = {38},
number = {1},
pages = {42--70},
year = {2004},
url = {https://doi.org/10.1287/trsc.1030.0041},
doi = {10.1287/TRSC.1030.0041},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/KleywegtNS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/CampbellS04,
author = {Ann Melissa Campbell and
Martin W. P. Savelsbergh},
title = {Delivery Volume Optimization},
journal = {Transp. Sci.},
volume = {38},
number = {2},
pages = {210--223},
year = {2004},
url = {https://doi.org/10.1287/trsc.1030.0042},
doi = {10.1287/TRSC.1030.0042},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/CampbellS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/CampbellS04a,
author = {Ann Melissa Campbell and
Martin W. P. Savelsbergh},
title = {Efficient Insertion Heuristics for Vehicle Routing and Scheduling
Problems},
journal = {Transp. Sci.},
volume = {38},
number = {3},
pages = {369--378},
year = {2004},
url = {https://doi.org/10.1287/trsc.1030.0046},
doi = {10.1287/TRSC.1030.0046},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/CampbellS04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/CampbellS04b,
author = {Ann Melissa Campbell and
Martin W. P. Savelsbergh},
title = {A Decomposition Approach for the Inventory-Routing Problem},
journal = {Transp. Sci.},
volume = {38},
number = {4},
pages = {488--502},
year = {2004},
url = {https://doi.org/10.1287/trsc.1030.0054},
doi = {10.1287/TRSC.1030.0054},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/CampbellS04b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HoeselKLS03,
author = {Stan P. M. van Hoesel and
Arie M. C. A. Koster and
Robert L. M. J. van de Leensel and
Martin W. P. Savelsbergh},
title = {Bidirected and unidirected capacity installation in telecommunication
networks},
journal = {Discret. Appl. Math.},
volume = {133},
number = {1-3},
pages = {103--121},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00436-0},
doi = {10.1016/S0166-218X(03)00436-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HoeselKLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MillerNS03a,
author = {Andrew J. Miller and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {On the polyhedral structure of a multi-item production planning model
with setup times},
journal = {Math. Program.},
volume = {94},
number = {2-3},
pages = {375--405},
year = {2003},
url = {https://doi.org/10.1007/s10107-002-0325-y},
doi = {10.1007/S10107-002-0325-Y},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MillerNS03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MillerNS03,
author = {Andrew J. Miller and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {A multi-item production planning model with setup times: algorithms,
reformulations, and polyhedral characterizations for a special case},
journal = {Math. Program.},
volume = {95},
number = {1},
pages = {71--90},
year = {2003},
url = {https://doi.org/10.1007/s10107-002-0340-z},
doi = {10.1007/S10107-002-0340-Z},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MillerNS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HunsakerKST03,
author = {Brady Hunsaker and
Anton J. Kleywegt and
Martin W. P. Savelsbergh and
Craig A. Tovey},
title = {Optimal Online Algorithms for Minimax Resource Scheduling},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {4},
pages = {555--590},
year = {2003},
url = {https://doi.org/10.1137/S0895480101397761},
doi = {10.1137/S0895480101397761},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HunsakerKST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BauerLS02,
author = {Petra Bauer and
Jeff T. Linderoth and
Martin W. P. Savelsbergh},
title = {A branch and cut approach to the cardinality constrained circuit problem},
journal = {Math. Program.},
volume = {91},
number = {2},
pages = {307--348},
year = {2002},
url = {https://doi.org/10.1007/s101070100209},
doi = {10.1007/S101070100209},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BauerLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HoeselKLS02,
author = {Stan P. M. van Hoesel and
Arie M. C. A. Koster and
Robert L. M. J. van de Leensel and
Martin W. P. Savelsbergh},
title = {Polyhedral results for the edge capacity polytope},
journal = {Math. Program.},
volume = {92},
number = {2},
pages = {335--358},
year = {2002},
url = {https://doi.org/10.1007/s101070200292},
doi = {10.1007/S101070200292},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HoeselKLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/WatererJNS02,
author = {Hamish Waterer and
Ellis L. Johnson and
Paolo Nobili and
Martin W. P. Savelsbergh},
title = {The relation of time indexed formulations of single machine scheduling
problems to the node packing problem},
journal = {Math. Program.},
volume = {93},
number = {3},
pages = {477--494},
year = {2002},
url = {https://doi.org/10.1007/s10107-002-0335-9},
doi = {10.1007/S10107-002-0335-9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/WatererJNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HunsakerS02,
author = {Brady Hunsaker and
Martin W. P. Savelsbergh},
title = {Efficient feasibility testing for dial-a-ride problems},
journal = {Oper. Res. Lett.},
volume = {30},
number = {3},
pages = {169--173},
year = {2002},
url = {https://doi.org/10.1016/S0167-6377(02)00120-7},
doi = {10.1016/S0167-6377(02)00120-7},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HunsakerS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/KleywegtNS02,
author = {Anton J. Kleywegt and
Vijay S. Nori and
Martin W. P. Savelsbergh},
title = {The Stochastic Inventory Routing Problem with Direct Deliveries},
journal = {Transp. Sci.},
volume = {36},
number = {1},
pages = {94--118},
year = {2002},
url = {https://doi.org/10.1287/trsc.36.1.94.574},
doi = {10.1287/TRSC.36.1.94.574},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/KleywegtNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/siam/02/CampbellCS02,
author = {Ann M. Campbell and
Lloyd W. Clarke and
Martin W. P. Savelsbergh},
editor = {Paolo Toth and
Daniele Vigo},
title = {Inventory Routing in Practice},
booktitle = {The Vehicle Routing Problem},
series = {{SIAM} monographs on discrete mathematics and applications},
volume = {9},
pages = {309--330},
publisher = {{SIAM}},
year = {2002},
url = {https://doi.org/10.1137/1.9780898718515.ch12},
doi = {10.1137/1.9780898718515.CH12},
timestamp = {Fri, 19 Jul 2019 09:54:09 +0200},
biburl = {https://dblp.org/rec/books/siam/02/CampbellCS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CavalcanteSSWW01,
author = {Cristina C. B. Cavalcante and
C. Carvalho de Souza and
Martin W. P. Savelsbergh and
Y. Wang and
Laurence A. Wolsey},
title = {Scheduling projects with labor constraints},
journal = {Discret. Appl. Math.},
volume = {112},
number = {1-3},
pages = {27--52},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00308-5},
doi = {10.1016/S0166-218X(00)00308-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CavalcanteSSWW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/DepuySAM01,
author = {Gail W. DePuy and
Martin W. P. Savelsbergh and
Jane C. Ammons and
Leon F. McGinnis},
title = {An Integer Programming Heuristic for Component Allocation in Printed
Circuit Card Assembly Systems},
journal = {J. Heuristics},
volume = {7},
number = {4},
pages = {351--369},
year = {2001},
url = {https://doi.org/10.1023/A:1011388227723},
doi = {10.1023/A:1011388227723},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/DepuySAM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LinderothLS01,
author = {Jeff T. Linderoth and
Eva K. Lee and
Martin W. P. Savelsbergh},
title = {A Parallel, Linear Programming-based Heuristic for Large-Scale Set
Partitioning Problems},
journal = {{INFORMS} J. Comput.},
volume = {13},
number = {3},
pages = {191--209},
year = {2001},
url = {https://doi.org/10.1287/ijoc.13.3.191.12630},
doi = {10.1287/IJOC.13.3.191.12630},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LinderothLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AtamturkNS01,
author = {Alper Atamt{\"{u}}rk and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Valid inequalities for problems with additive variable upper bounds},
journal = {Math. Program.},
volume = {91},
number = {1},
pages = {145--162},
year = {2001},
url = {https://doi.org/10.1007/s101070100235},
doi = {10.1007/S101070100235},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AtamturkNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MillerNS01,
author = {Andrew J. Miller and
George L. Nemhauser and
Martin W. P. Savelsbergh},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Facets, Algorithms, and Polyhedral Characterizations for a Multi-item
Production Planning Model with Setup Times},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {318--332},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_25},
doi = {10.1007/3-540-45535-3\_25},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MillerNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AtamturkNS00,
author = {Alper Atamt{\"{u}}rk and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Conflict graphs in solving integer programming problems},
journal = {Eur. J. Oper. Res.},
volume = {121},
number = {1},
pages = {40--55},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00015-6},
doi = {10.1016/S0377-2217(99)00015-6},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AtamturkNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MillerNS00,
author = {Andrew J. Miller and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra},
journal = {Eur. J. Oper. Res.},
volume = {125},
number = {2},
pages = {298--315},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00461-0},
doi = {10.1016/S0377-2217(99)00461-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MillerNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/JohnsonNS00,
author = {Ellis L. Johnson and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Progress in Linear Programming-Based Algorithms for Integer Programming:
An Exposition},
journal = {{INFORMS} J. Comput.},
volume = {12},
number = {1},
pages = {2--23},
year = {2000},
url = {https://doi.org/10.1287/ijoc.12.1.2.11900},
doi = {10.1287/IJOC.12.1.2.11900},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/JohnsonNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AkkerHS00,
author = {Marjan van den Akker and
Cor A. J. Hurkens and
Martin W. P. Savelsbergh},
title = {Time-Indexed Formulations for Machine Scheduling Problems: Column
Generation},
journal = {{INFORMS} J. Comput.},
volume = {12},
number = {2},
pages = {111--124},
year = {2000},
url = {https://doi.org/10.1287/ijoc.12.2.111.11896},
doi = {10.1287/IJOC.12.2.111.11896},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AkkerHS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AtamturkJLS00,
author = {Alper Atamt{\"{u}}rk and
Ellis L. Johnson and
Jeff T. Linderoth and
Martin W. P. Savelsbergh},
title = {A Relational Modeling System for Linear and Integer Programming},
journal = {Oper. Res.},
volume = {48},
number = {6},
pages = {846--857},
year = {2000},
url = {https://doi.org/10.1287/opre.48.6.846.12388},
doi = {10.1287/OPRE.48.6.846.12388},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AtamturkJLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuNS00,
author = {Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Sequence Independent Lifting in Mixed Integer Programming},
journal = {J. Comb. Optim.},
volume = {4},
number = {1},
pages = {109--129},
year = {2000},
url = {https://doi.org/10.1023/A:1009841107478},
doi = {10.1023/A:1009841107478},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AtamturkNS00,
author = {Alper Atamt{\"{u}}rk and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {The mixed vertex packing problem},
journal = {Math. Program.},
volume = {89},
number = {1},
pages = {35--53},
year = {2000},
url = {https://doi.org/10.1007/s101070000154.},
doi = {10.1007/S101070000154.},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AtamturkNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dss/DesrochersJLSS99,
author = {Martin Desrochers and
Christopher V. Jones and
Jan Karel Lenstra and
Martin W. P. Savelsbergh and
Leen Stougie},
title = {Towards a model and algorithm management system for vehicle routing
and scheduling problems},
journal = {Decis. Support Syst.},
volume = {25},
number = {2},
pages = {109--133},
year = {1999},
url = {https://doi.org/10.1016/S0167-9236(98)00090-6},
doi = {10.1016/S0167-9236(98)00090-6},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dss/DesrochersJLSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/GuNS99,
author = {Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Lifted Cover Inequalities for 0-1 Integer Programs: Complexity},
journal = {{INFORMS} J. Comput.},
volume = {11},
number = {1},
pages = {117--123},
year = {1999},
url = {https://doi.org/10.1287/ijoc.11.1.117},
doi = {10.1287/IJOC.11.1.117},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/GuNS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LinderothS99,
author = {Jeff T. Linderoth and
Martin W. P. Savelsbergh},
title = {A Computational Study of Search Strategies for Mixed Integer Programming},
journal = {{INFORMS} J. Comput.},
volume = {11},
number = {2},
pages = {173--187},
year = {1999},
url = {https://doi.org/10.1287/ijoc.11.2.173},
doi = {10.1287/IJOC.11.2.173},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LinderothS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GuNS99,
author = {Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Lifted flow cover inequalities for mixed 0-1 integer programs},
journal = {Math. Program.},
volume = {85},
number = {3},
pages = {439--467},
year = {1999},
url = {https://doi.org/10.1007/s101070050067},
doi = {10.1007/S101070050067},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/GuNS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AkkerHS99,
author = {J. M. van den Akker and
C. P. M. van Hoesel and
Martin W. P. Savelsbergh},
title = {A polyhedral approach to single-machine scheduling problems},
journal = {Math. Program.},
volume = {85},
number = {3},
pages = {541--572},
year = {1999},
url = {https://doi.org/10.1007/s10107990047a},
doi = {10.1007/S10107990047A},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AkkerHS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AtamturkNS99,
author = {Alper Atamt{\"{u}}rk and
George L. Nemhauser and
Martin W. P. Savelsbergh},
editor = {G{\'{e}}rard Cornu{\'{e}}jols and
Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Valid Inequalities for Problems with Additive Variable Upper Bounds},
booktitle = {Integer Programming and Combinatorial Optimization, 7th International
{IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1610},
pages = {60--72},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48777-8\_5},
doi = {10.1007/3-540-48777-8\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AtamturkNS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KleywegtNST99,
author = {Anton J. Kleywegt and
Vijay S. Nori and
Martin W. P. Savelsbergh and
Craig A. Tovey},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Online Resource Minimization},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {576--585},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314879},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/KleywegtNST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/GuNS98,
author = {Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {Lifted Cover Inequalities for 0-1 Integer Programs: Computation},
journal = {{INFORMS} J. Comput.},
volume = {10},
number = {4},
pages = {427--437},
year = {1998},
url = {https://doi.org/10.1287/ijoc.10.4.427},
doi = {10.1287/IJOC.10.4.427},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/GuNS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BarnhartJNSV98,
author = {Cynthia Barnhart and
Ellis L. Johnson and
George L. Nemhauser and
Martin W. P. Savelsbergh and
Pamela H. Vance},
title = {Branch-and-Price: Column Generation for Solving Huge Integer Programs},
journal = {Oper. Res.},
volume = {46},
number = {3},
pages = {316--329},
year = {1998},
url = {https://doi.org/10.1287/opre.46.3.316},
doi = {10.1287/OPRE.46.3.316},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/BarnhartJNSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/SavelsberghS98,
author = {Martin W. P. Savelsbergh and
Marc Sol},
title = {Drive: Dynamic Routing of Independent Vehicles},
journal = {Oper. Res.},
volume = {46},
number = {4},
pages = {474--490},
year = {1998},
url = {https://doi.org/10.1287/opre.46.4.474},
doi = {10.1287/OPRE.46.4.474},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SavelsberghS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SavelsberghUW98,
author = {Martin W. P. Savelsbergh and
R. N. Uma and
Joel Wein},
editor = {Howard J. Karloff},
title = {An Experimental Study of LP-Based Approximation Algorithms for Scheduling
Problems},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {453--462},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314825},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/SavelsberghUW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Savelsbergh97,
author = {Martin W. P. Savelsbergh},
title = {A Branch-and-Price Algorithm for the Generalized Assignment Problem},
journal = {Oper. Res.},
volume = {45},
number = {6},
pages = {831--841},
year = {1997},
url = {https://doi.org/10.1287/opre.45.6.831},
doi = {10.1287/OPRE.45.6.831},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Savelsbergh97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dss/WenninkS96,
author = {Marc Wennink and
Martin W. P. Savelsbergh},
title = {Towards a planning board generator},
journal = {Decis. Support Syst.},
volume = {17},
number = {3},
pages = {199--226},
year = {1996},
url = {https://doi.org/10.1016/0167-9236(95)00032-1},
doi = {10.1016/0167-9236(95)00032-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dss/WenninkS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/AtamturkNS96,
author = {Alper Atamt{\"{u}}rk and
George L. Nemhauser and
Martin W. P. Savelsbergh},
title = {A combined Lagrangian, linear programming, and implication heuristic
for large-scale set partitioning problems},
journal = {J. Heuristics},
volume = {1},
number = {2},
pages = {247--259},
year = {1996},
url = {https://doi.org/10.1007/BF00127080},
doi = {10.1007/BF00127080},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/AtamturkNS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/SavelsberghS95,
author = {Martin W. P. Savelsbergh and
Marc Sol},
title = {The General Pickup and Delivery Problem},
journal = {Transp. Sci.},
volume = {29},
number = {1},
pages = {17--29},
year = {1995},
url = {https://doi.org/10.1287/trsc.29.1.17},
doi = {10.1287/TRSC.29.1.17},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/SavelsberghS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GuNS95,
author = {Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh},
editor = {Egon Balas and
Jens Clausen},
title = {Sequence Independent Lifting of Cover Inequalities},
booktitle = {Integer Programming and Combinatorial Optimization, 4th International
{IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {920},
pages = {452--461},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59408-6\_72},
doi = {10.1007/3-540-59408-6\_72},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/GuNS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Savelsbergh94,
author = {Martin W. P. Savelsbergh},
title = {Preprocessing and Probing Techniques for Mixed Integer Programming
Problems},
journal = {{INFORMS} J. Comput.},
volume = {6},
number = {4},
pages = {445--454},
year = {1994},
url = {https://doi.org/10.1287/ijoc.6.4.445},
doi = {10.1287/IJOC.6.4.445},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Savelsbergh94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NemhauserSS94,
author = {George L. Nemhauser and
Martin W. P. Savelsbergh and
Gabriele Sigismondi},
title = {MINTO, a mixed INTeger optimizer},
journal = {Oper. Res. Lett.},
volume = {15},
number = {1},
pages = {47--58},
year = {1994},
url = {https://doi.org/10.1016/0167-6377(94)90013-2},
doi = {10.1016/0167-6377(94)90013-2},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/NemhauserSS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KindervaterLS93,
author = {Gerard A. P. Kindervater and
Jan Karel Lenstra and
Martin W. P. Savelsbergh},
title = {Sequential and Parallel Local Search for the Time-Constrained Traveling
Salesman Problem},
journal = {Discret. Appl. Math.},
volume = {42},
number = {2},
pages = {211--225},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90047-R},
doi = {10.1016/0166-218X(93)90047-R},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KindervaterLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Savelsbergh92,
author = {Martin W. P. Savelsbergh},
title = {The Vehicle Routing Problem with Time Windows: Minimizing Route Duration},
journal = {{INFORMS} J. Comput.},
volume = {4},
number = {2},
pages = {146--154},
year = {1992},
url = {https://doi.org/10.1287/ijoc.4.2.146},
doi = {10.1287/IJOC.4.2.146},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Savelsbergh92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dss/AnthonisseLS88,
author = {Jac M. Anthonisse and
Jan Karel Lenstra and
Martin W. P. Savelsbergh},
title = {Behind the screen: {DSS} from an {OR} point of view},
journal = {Decis. Support Syst.},
volume = {4},
number = {4},
pages = {413--419},
year = {1988},
url = {https://doi.org/10.1016/0167-9236(88)90004-8},
doi = {10.1016/0167-9236(88)90004-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dss/AnthonisseLS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/SavelsberghV85,
author = {Martin W. P. Savelsbergh and
Ton Volgenant},
title = {Edge exchanges in the degree-constrained minimum spanning tree problem},
journal = {Comput. Oper. Res.},
volume = {12},
number = {4},
pages = {341--348},
year = {1985},
url = {https://doi.org/10.1016/0305-0548(85)90032-2},
doi = {10.1016/0305-0548(85)90032-2},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/SavelsberghV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
