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/networks54.bht:"
download as .bib file
@article{DBLP:journals/networks/Agarwal09,
author = {Yogesh Kumar Agarwal},
title = {Polyhedral structure of the 4-node network design problem},
journal = {Networks},
volume = {54},
number = {3},
pages = {139--149},
year = {2009},
url = {https://doi.org/10.1002/net.20317},
doi = {10.1002/NET.20317},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Agarwal09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BalasS09,
author = {Egon Balas and
R{\"{u}}diger Stephan},
title = {On the cycle polytope of a directed graph and its relaxations},
journal = {Networks},
volume = {54},
number = {1},
pages = {47--55},
year = {2009},
url = {https://doi.org/10.1002/net.20304},
doi = {10.1002/NET.20304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BalasS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BaldacciBV09,
author = {Roberto Baldacci and
Maria Battarra and
Daniele Vigo},
title = {Valid inequalities for the fleet size and mix vehicle routing problem
with fixed costs},
journal = {Networks},
volume = {54},
number = {4},
pages = {178--189},
year = {2009},
url = {https://doi.org/10.1002/net.20331},
doi = {10.1002/NET.20331},
timestamp = {Thu, 25 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BaldacciBV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BauerHKS09,
author = {Douglas Bauer and
S. Louis Hakimi and
Nathan Kahl and
Edward F. Schmeichel},
title = {Sufficient degree conditions for \emph{k}-edge-connectedness of a
graph},
journal = {Networks},
volume = {54},
number = {2},
pages = {95--98},
year = {2009},
url = {https://doi.org/10.1002/net.20299},
doi = {10.1002/NET.20299},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BauerHKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenaventCPS09,
author = {Enrique Benavent and
Angel Corber{\'{a}}n and
Isaac Plana and
Jos{\'{e}} M. Sanchis},
title = {Min-Max \emph{K}-vehicles windy rural postman problem},
journal = {Networks},
volume = {54},
number = {4},
pages = {216--226},
year = {2009},
url = {https://doi.org/10.1002/net.20334},
doi = {10.1002/NET.20334},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BenaventCPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BerubeGP09,
author = {Jean{-}Fran{\c{c}}ois B{\'{e}}rub{\'{e}} and
Michel Gendreau and
Jean{-}Yves Potvin},
title = {A branch-and-cut algorithm for the undirected prize collecting traveling
salesman problem},
journal = {Networks},
volume = {54},
number = {1},
pages = {56--67},
year = {2009},
url = {https://doi.org/10.1002/net.20307},
doi = {10.1002/NET.20307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BerubeGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Bley09,
author = {Andreas Bley},
title = {Approximability of unsplittable shortest path routing problems},
journal = {Networks},
volume = {54},
number = {1},
pages = {23--46},
year = {2009},
url = {https://doi.org/10.1002/net.20303},
doi = {10.1002/NET.20303},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Bley09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoeschGSKSS09,
author = {Frank Boesch and
Daniel Gross and
John T. Saccoman and
L. William Kazmierczak and
Charles L. Suffel and
Antonius Suhartomo},
title = {A generalization of an edge-connectivity theorem of Chartrand},
journal = {Networks},
volume = {54},
number = {2},
pages = {82--89},
year = {2009},
url = {https://doi.org/10.1002/net.20297},
doi = {10.1002/NET.20297},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoeschGSKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoeschSS09,
author = {Francis T. Boesch and
Appajosyula Satyanarayana and
Charles L. Suffel},
title = {A survey of some network reliability analysis and synthesis results},
journal = {Networks},
volume = {54},
number = {2},
pages = {99--107},
year = {2009},
url = {https://doi.org/10.1002/net.20300},
doi = {10.1002/NET.20300},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoeschSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownD09,
author = {Jason I. Brown and
Karl Dilcher},
title = {On the roots of strongly connected reliability polynomials},
journal = {Networks},
volume = {54},
number = {2},
pages = {108--116},
year = {2009},
url = {https://doi.org/10.1002/net.20301},
doi = {10.1002/NET.20301},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChartrandJMZ09,
author = {Gary Chartrand and
Garry L. Johns and
Kathleen A. McKeon and
Ping Zhang},
title = {The rainbow connectivity of a graph},
journal = {Networks},
volume = {54},
number = {2},
pages = {75--81},
year = {2009},
url = {https://doi.org/10.1002/net.20296},
doi = {10.1002/NET.20296},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChartrandJMZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenCTT09,
author = {Hui Chen and
Ann Melissa Campbell and
Barrett W. Thomas and
Arie Tamir},
title = {Minimax flow tree problems},
journal = {Networks},
volume = {54},
number = {3},
pages = {117--129},
year = {2009},
url = {https://doi.org/10.1002/net.20313},
doi = {10.1002/NET.20313},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ChenCTT09.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/networks/GavoilleKKKN09,
author = {Cyril Gavoille and
Ralf Klasing and
Adrian Kosowski and
Lukasz Kuszner and
Alfredo Navarra},
title = {On the complexity of distributed graph coloring with local minimality
constraints},
journal = {Networks},
volume = {54},
number = {1},
pages = {12--19},
year = {2009},
url = {https://doi.org/10.1002/net.20293},
doi = {10.1002/NET.20293},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/GavoilleKKKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GolumbicLS09,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Edge intersection graphs of single bend paths on a grid},
journal = {Networks},
volume = {54},
number = {3},
pages = {130--138},
year = {2009},
url = {https://doi.org/10.1002/net.20305},
doi = {10.1002/NET.20305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GolumbicLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GroerGW09,
author = {Chris Gro{\"{e}}r and
Bruce L. Golden and
Edward A. Wasil},
title = {The balanced billing cycle vehicle routing problem},
journal = {Networks},
volume = {54},
number = {4},
pages = {243--254},
year = {2009},
url = {https://doi.org/10.1002/net.20336},
doi = {10.1002/NET.20336},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GroerGW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HavetKS09,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Ross J. Kang and
Jean{-}S{\'{e}}bastien Sereni},
title = {Improper coloring of unit disk graphs},
journal = {Networks},
volume = {54},
number = {3},
pages = {150--164},
year = {2009},
url = {https://doi.org/10.1002/net.20318},
doi = {10.1002/NET.20318},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HavetKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HsiehL09,
author = {Sun{-}Yuan Hsieh and
Tsong{-}Jie Lin},
title = {Panconnectivity and edge-pancyclicity of \emph{k}-ary \emph{n}-cubes},
journal = {Networks},
volume = {54},
number = {1},
pages = {1--11},
year = {2009},
url = {https://doi.org/10.1002/net.20290},
doi = {10.1002/NET.20290},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HsiehL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagataB09,
author = {Yuichi Nagata and
Olli Br{\"{a}}ysy},
title = {Edge assembly-based memetic algorithm for the capacitated vehicle
routing problem},
journal = {Networks},
volume = {54},
number = {4},
pages = {205--215},
year = {2009},
url = {https://doi.org/10.1002/net.20333},
doi = {10.1002/NET.20333},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/NagataB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ParraghDHG09,
author = {Sophie N. Parragh and
Karl F. Doerner and
Richard F. Hartl and
Xavier Gandibleux},
title = {A heuristic two-phase solution approach for the multi-objective dial-a-ride
problem},
journal = {Networks},
volume = {54},
number = {4},
pages = {227--242},
year = {2009},
url = {https://doi.org/10.1002/net.20335},
doi = {10.1002/NET.20335},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ParraghDHG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PessoaUA09,
author = {Artur Alves Pessoa and
Eduardo Uchoa and
Marcus Poggi de Arag{\~{a}}o},
title = {A robust branch-cut-and-price algorithm for the heterogeneous fleet
vehicle routing problem},
journal = {Networks},
volume = {54},
number = {4},
pages = {167--177},
year = {2009},
url = {https://doi.org/10.1002/net.20330},
doi = {10.1002/NET.20330},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PessoaUA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PetingiT09,
author = {Louis Petingi and
M. Talafha},
title = {Packing the Steiner trees of a graph},
journal = {Networks},
volume = {54},
number = {2},
pages = {90--94},
year = {2009},
url = {https://doi.org/10.1002/net.20298},
doi = {10.1002/NET.20298},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PetingiT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Prescott-GagnonDR09,
author = {Eric Prescott{-}Gagnon and
Guy Desaulniers and
Louis{-}Martin Rousseau},
title = {A branch-and-price-based large neighborhood search algorithm for the
vehicle routing problem with time windows},
journal = {Networks},
volume = {54},
number = {4},
pages = {190--204},
year = {2009},
url = {https://doi.org/10.1002/net.20332},
doi = {10.1002/NET.20332},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Prescott-GagnonDR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShenDO09,
author = {Zhihong Shen and
Maged M. Dessouky and
Fernando Ord{\'{o}}{\~{n}}ez},
title = {A two-stage vehicle routing model for large-scale bioterrorism emergencies},
journal = {Networks},
volume = {54},
number = {4},
pages = {255--269},
year = {2009},
url = {https://doi.org/10.1002/net.20337},
doi = {10.1002/NET.20337},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ShenDO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Slater09,
author = {Peter J. Slater},
title = {Liar's domination},
journal = {Networks},
volume = {54},
number = {2},
pages = {70--74},
year = {2009},
url = {https://doi.org/10.1002/net.20295},
doi = {10.1002/NET.20295},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Slater09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Suffel09,
author = {Charles L. Suffel},
title = {A eulogy for Frank Boesch},
journal = {Networks},
volume = {54},
number = {2},
pages = {69},
year = {2009},
url = {https://doi.org/10.1002/net.20294},
doi = {10.1002/NET.20294},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Suffel09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TanakaS09,
author = {Yuuki Tanaka and
Yukio Shibata},
title = {A note on the \emph{k}-degree Cayley graph},
journal = {Networks},
volume = {54},
number = {1},
pages = {20--22},
year = {2009},
url = {https://doi.org/10.1002/net.20302},
doi = {10.1002/NET.20302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TanakaS09.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-05-30 06:05 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:
