Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks65.bht:"
download as .bib file
@article{DBLP:journals/networks/AdasmeALL15,
author = {Pablo Adasme and
Rafael Andrade and
Marc Letournel and
Abdel Lisser},
title = {Stochastic maximum weight forest problem},
journal = {Networks},
volume = {65},
number = {4},
pages = {289--305},
year = {2015},
url = {https://doi.org/10.1002/net.21610},
doi = {10.1002/NET.21610},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/AdasmeALL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ArulselvanMS15,
author = {Ashwin Arulselvan and
Olaf Maurer and
Martin Skutella},
title = {An incremental algorithm for the uncapacitated facility location problem},
journal = {Networks},
volume = {65},
number = {4},
pages = {306--311},
year = {2015},
url = {https://doi.org/10.1002/net.21595},
doi = {10.1002/NET.21595},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ArulselvanMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AvellaBW15,
author = {Pasquale Avella and
Maurizio Boccia and
Laurence A. Wolsey},
title = {Single-item reformulations for a vendor managed inventory routing
problem: Computational experience with benchmark instances},
journal = {Networks},
volume = {65},
number = {2},
pages = {129--138},
year = {2015},
url = {https://doi.org/10.1002/net.21586},
doi = {10.1002/NET.21586},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AvellaBW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AvilaCPS15,
author = {Thais {\'{A}}vila and
Angel Corber{\'{a}}n and
Isaac Plana and
Jos{\'{e}} Mar{\'{\i}}a Sanchis},
title = {The stacker crane problem and the directed general routing problem},
journal = {Networks},
volume = {65},
number = {1},
pages = {43--55},
year = {2015},
url = {https://doi.org/10.1002/net.21591},
doi = {10.1002/NET.21591},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/AvilaCPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BattarraEE15,
author = {Maria Battarra and
Richard W. Eglese and
G{\"{u}}nes Erdogan},
title = {Guest editorial: Recent trends in vehicle routing},
journal = {Networks},
volume = {65},
number = {2},
pages = {101},
year = {2015},
url = {https://doi.org/10.1002/net.21593},
doi = {10.1002/NET.21593},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BattarraEE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BauguionBG15,
author = {Pierre{-}Olivier Bauguion and
Walid Ben{-}Ameur and
{\'{E}}ric Gourdin},
title = {Efficient algorithms for the maximum concurrent flow problem},
journal = {Networks},
volume = {65},
number = {1},
pages = {56--67},
year = {2015},
url = {https://doi.org/10.1002/net.21572},
doi = {10.1002/NET.21572},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BauguionBG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BektasL15,
author = {Tolga Bektas and
Jens Lysgaard},
title = {Optimal vehicle routing with lower and upper bounds on route durations},
journal = {Networks},
volume = {65},
number = {2},
pages = {166--179},
year = {2015},
url = {https://doi.org/10.1002/net.21592},
doi = {10.1002/NET.21592},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BektasL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoglDP15,
author = {Michael B{\"{o}}gl and
Karl F. Doerner and
Sophie N. Parragh},
title = {The school bus routing and scheduling problem with transfers},
journal = {Networks},
volume = {65},
number = {2},
pages = {180--203},
year = {2015},
url = {https://doi.org/10.1002/net.21589},
doi = {10.1002/NET.21589},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BoglDP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BorndorferBSS15,
author = {Ralf Bornd{\"{o}}rfer and
Julia Buwaya and
Guillaume Sagnol and
Elmar Swarat},
title = {Network spot-checking games: Theory and application to toll enforcing
in transportation networks},
journal = {Networks},
volume = {65},
number = {4},
pages = {312--328},
year = {2015},
url = {https://doi.org/10.1002/net.21596},
doi = {10.1002/NET.21596},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BorndorferBSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ContardoDL15,
author = {Claudio Contardo and
Guy Desaulniers and
Fran{\c{c}}ois Lessard},
title = {Reaching the elementary lower bound in the vehicle routing problem
with time windows},
journal = {Networks},
volume = {65},
number = {1},
pages = {88--99},
year = {2015},
url = {https://doi.org/10.1002/net.21594},
doi = {10.1002/NET.21594},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ContardoDL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CunhaSLG15,
author = {Alexandre Salles da Cunha and
Luidi Simonetti and
Abilio Lucena and
Bernard Gendron},
title = {Formulations and exact solution approaches for the degree preserving
spanning tree problem},
journal = {Networks},
volume = {65},
number = {4},
pages = {329--343},
year = {2015},
url = {https://doi.org/10.1002/net.21590},
doi = {10.1002/NET.21590},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CunhaSLG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DArianoPPP15,
author = {Andrea D'Ariano and
Dario Pacciarelli and
Marco Pistelli and
Marco Pranzo},
title = {Real-time scheduling of aircraft arrivals and departures in a terminal
maneuvering area},
journal = {Networks},
volume = {65},
number = {3},
pages = {212--227},
year = {2015},
url = {https://doi.org/10.1002/net.21599},
doi = {10.1002/NET.21599},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DArianoPPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DongOKM15,
author = {Yuanyuan Dong and
Eli V. Olinick and
T. Jason Kratz and
David W. Matula},
title = {A compact linear programming formulation of the maximum concurrent
flow problem},
journal = {Networks},
volume = {65},
number = {1},
pages = {68--87},
year = {2015},
url = {https://doi.org/10.1002/net.21583},
doi = {10.1002/NET.21583},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DongOKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GiroirePT15,
author = {Fr{\'{e}}d{\'{e}}ric Giroire and
St{\'{e}}phane P{\'{e}}rennes and
Issam Tahiri},
title = {On the complexity of equal shortest path routing},
journal = {Networks},
volume = {65},
number = {4},
pages = {344--352},
year = {2015},
url = {https://doi.org/10.1002/net.21612},
doi = {10.1002/NET.21612},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GiroirePT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HarksKKM15,
author = {Tobias Harks and
Ingo Kleinert and
Max Klimm and
Rolf H. M{\"{o}}hring},
title = {Computing network tolls with support constraints},
journal = {Networks},
volume = {65},
number = {3},
pages = {262--285},
year = {2015},
url = {https://doi.org/10.1002/net.21604},
doi = {10.1002/NET.21604},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HarksKKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KalcsicsNPR15,
author = {J{\"{o}}rg Kalcsics and
Stefan Nickel and
Justo Puerto and
Antonio M. Rodr{\'{\i}}guez{-}Ch{\'{\i}}a},
title = {Several 2-facility location problems on networks with equity objectives},
journal = {Networks},
volume = {65},
number = {1},
pages = {1--9},
year = {2015},
url = {https://doi.org/10.1002/net.21568},
doi = {10.1002/NET.21568},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KalcsicsNPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KohlerS15,
author = {Ekkehard K{\"{o}}hler and
Martin Strehler},
title = {Traffic signal optimization using cyclically expanded networks},
journal = {Networks},
volume = {65},
number = {3},
pages = {244--261},
year = {2015},
url = {https://doi.org/10.1002/net.21601},
doi = {10.1002/NET.21601},
timestamp = {Mon, 05 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KohlerS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MalagutiMBZ15,
author = {Enrico Malaguti and
Isabel M{\'{e}}ndez{-}D{\'{\i}}az and
Juan Jos{\'{e}} Miranda Bront and
Paula Zabala},
title = {A branch-and-price algorithm for the (\emph{k, c})-coloring problem},
journal = {Networks},
volume = {65},
number = {4},
pages = {353--366},
year = {2015},
url = {https://doi.org/10.1002/net.21579},
doi = {10.1002/NET.21579},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MalagutiMBZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ManerbaM15,
author = {Daniele Manerba and
Renata Mansini},
title = {A branch-and-cut algorithm for the multi-vehicle traveling purchaser
problem with pairwise incompatibility constraints},
journal = {Networks},
volume = {65},
number = {2},
pages = {139--154},
year = {2015},
url = {https://doi.org/10.1002/net.21588},
doi = {10.1002/NET.21588},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ManerbaM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MarkovicRS15,
author = {Nikola Markovic and
Ilya O. Ryzhov and
Paul M. Schonfeld},
title = {Evasive flow capture: Optimal location of weigh-in-motion systems,
tollbooths, and security checkpoints},
journal = {Networks},
volume = {65},
number = {1},
pages = {22--42},
year = {2015},
url = {https://doi.org/10.1002/net.21581},
doi = {10.1002/NET.21581},
timestamp = {Mon, 04 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/MarkovicRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PereiraGC15,
author = {Dilson Lucas Pereira and
Michel Gendreau and
Alexandre Salles da Cunha},
title = {Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent
only quadratic minimum spanning tree problem},
journal = {Networks},
volume = {65},
number = {4},
pages = {367--379},
year = {2015},
url = {https://doi.org/10.1002/net.21580},
doi = {10.1002/NET.21580},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PereiraGC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RaghavanS15,
author = {S. Raghavan and
Mustafa Sahin},
title = {Efficient Edge-swapping heuristics for the reload cost spanning tree
problem},
journal = {Networks},
volume = {65},
number = {4},
pages = {380--394},
year = {2015},
url = {https://doi.org/10.1002/net.21609},
doi = {10.1002/NET.21609},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RaghavanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RodriguesF15,
author = {Ana Maria Rodrigues and
Jos{\'{e}} Soeiro Ferreira},
title = {Waste collection routing - limited multiple landfills and heterogeneous
fleet},
journal = {Networks},
volume = {65},
number = {2},
pages = {155--165},
year = {2015},
url = {https://doi.org/10.1002/net.21597},
doi = {10.1002/NET.21597},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RodriguesF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Sanchez-OroLDM15,
author = {Jes{\'{u}}s S{\'{a}}nchez{-}Oro and
Manuel Laguna and
Abraham Duarte and
Rafael Mart{\'{\i}}},
title = {Scatter search for the profile minimization problem},
journal = {Networks},
volume = {65},
number = {1},
pages = {10--21},
year = {2015},
url = {https://doi.org/10.1002/net.21571},
doi = {10.1002/NET.21571},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Sanchez-OroLDM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SchmidtS15,
author = {Marie Schmidt and
Anita Sch{\"{o}}bel},
title = {The complexity of integrating passenger routing decisions in public
transportation models},
journal = {Networks},
volume = {65},
number = {3},
pages = {228--243},
year = {2015},
url = {https://doi.org/10.1002/net.21600},
doi = {10.1002/NET.21600},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SchmidtS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/VidalCGP15,
author = {Thibaut Vidal and
Teodor Gabriel Crainic and
Michel Gendreau and
Christian Prins},
title = {Timing problems and algorithms: Time decisions for sequences of activities},
journal = {Networks},
volume = {65},
number = {2},
pages = {102--128},
year = {2015},
url = {https://doi.org/10.1002/net.21587},
doi = {10.1002/NET.21587},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/VidalCGP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WuW15,
author = {Bang Ye Wu and
Hung{-}Lung Wang},
title = {The next-to-shortest path problem on directed graphs with positive
edge weights},
journal = {Networks},
volume = {65},
number = {3},
pages = {205--211},
year = {2015},
url = {https://doi.org/10.1002/net.21598},
doi = {10.1002/NET.21598},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WuW15.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.
retrieved on 2024-06-04 01:00 CEST from data curated 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:
