Search dblp for Publications

export results for "toc:db/journals/networks/networks50.bht:"

 download as .bib file

@article{DBLP:journals/networks/AlvelosC07,
  author       = {Filipe Pereira Alvelos and
                  Jos{\'{e}} M. Val{\'{e}}rio de Carvalho},
  title        = {An extended model and a column generation algorithm for the planar
                  multicommodity flow problem},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {3--16},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20161},
  doi          = {10.1002/NET.20161},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/AlvelosC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/AsdreN07,
  author       = {Katerina Asdre and
                  Stavros D. Nikolopoulos},
  title        = {A linear-time algorithm for the \emph{k}-fixed-endpoint path cover
                  problem on cographs},
  journal      = {Networks},
  volume       = {50},
  number       = {4},
  pages        = {231--240},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20200},
  doi          = {10.1002/NET.20200},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/AsdreN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/AtamturkG07,
  author       = {Alper Atamt{\"{u}}rk and
                  Oktay G{\"{u}}nl{\"{u}}k},
  title        = {Network design arc set with variable upper bounds},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {17--28},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20162},
  doi          = {10.1002/NET.20162},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/AtamturkG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Ben-AmeurG07,
  author       = {Walid Ben{-}Ameur and
                  Luis Eduardo Neves Gouveia},
  title        = {Preface},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {1--2},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20160},
  doi          = {10.1002/NET.20160},
  timestamp    = {Mon, 21 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Ben-AmeurG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BermanW07,
  author       = {Oded Berman and
                  Jiamin Wang},
  title        = {The 1-minimax and 1-maximin problems with demand weights of general
                  probability distributions},
  journal      = {Networks},
  volume       = {50},
  number       = {2},
  pages        = {127--135},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20174},
  doi          = {10.1002/NET.20174},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BermanW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Bley07,
  author       = {Andreas Bley},
  title        = {Inapproximability results for the inverse shortest paths problem with
                  integer lengths and unique shortest paths},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {29--36},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20163},
  doi          = {10.1002/NET.20163},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Bley07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BouhtouEM07,
  author       = {Mustapha Bouhtou and
                  Guillaume Erbs and
                  Michel Minoux},
  title        = {Joint optimization of pricing and resource allocation in competitive
                  telecommunications networks},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {37--49},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20164},
  doi          = {10.1002/NET.20164},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BouhtouEM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ChekuriSOS07,
  author       = {Chandra Chekuri and
                  F. Bruce Shepherd and
                  Gianpaolo Oriolo and
                  Maria Grazia Scutell{\`{a}}},
  title        = {Hardness of robust network design},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {50--54},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20165},
  doi          = {10.1002/NET.20165},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ChekuriSOS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ChengL07,
  author       = {Eddie Cheng and
                  L{\'{a}}szl{\'{o}} Lipt{\'{a}}k},
  title        = {Matching preclusion for some interconnection networks},
  journal      = {Networks},
  volume       = {50},
  number       = {2},
  pages        = {173--180},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20187},
  doi          = {10.1002/NET.20187},
  timestamp    = {Sat, 01 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ChengL07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CunhaL07,
  author       = {Alexandre Salles da Cunha and
                  Abilio Lucena},
  title        = {Lower and upper bounds for the degree-constrained minimum spanning
                  tree problem},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {55--66},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20166},
  doi          = {10.1002/NET.20166},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CunhaL07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Dahl07,
  author       = {Geir Dahl},
  title        = {Majorization and distances in trees},
  journal      = {Networks},
  volume       = {50},
  number       = {4},
  pages        = {251--257},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20202},
  doi          = {10.1002/NET.20202},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/Dahl07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/DuC07,
  author       = {Donglei Du and
                  R. Chandrasekaran},
  title        = {The maximum residual flow problem: \emph{NP}-hardness with two-arc
                  destruction},
  journal      = {Networks},
  volume       = {50},
  number       = {3},
  pages        = {181--182},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20188},
  doi          = {10.1002/NET.20188},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/DuC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/FarleyC07,
  author       = {Toni R. Farley and
                  Charles J. Colbourn},
  title        = {Multiterminal resilience for series-parallel networks},
  journal      = {Networks},
  volume       = {50},
  number       = {2},
  pages        = {164--172},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20186},
  doi          = {10.1002/NET.20186},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/FarleyC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/FontesG07,
  author       = {Dalila B. M. M. Fontes and
                  Jos{\'{e}} Fernando Gon{\c{c}}alves},
  title        = {Heuristic solutions for general concave minimum cost network flow
                  problems},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {67--76},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20167},
  doi          = {10.1002/NET.20167},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/FontesG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Gomez07,
  author       = {Jos{\'{e}} G{\'{o}}mez},
  title        = {Large vertex symmetric digraphs},
  journal      = {Networks},
  volume       = {50},
  number       = {4},
  pages        = {241--250},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20201},
  doi          = {10.1002/NET.20201},
  timestamp    = {Thu, 16 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/Gomez07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HartlineS07,
  author       = {Jeff Hartline and
                  Alexa Sharp},
  title        = {Incremental flow},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {77--85},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20168},
  doi          = {10.1002/NET.20168},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HartlineS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HarutyunyanM07,
  author       = {Hovhannes A. Harutyunyan and
                  Calin D. Morosan},
  title        = {On the minimum path problem in Kn{\"{o}}del graphs},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {86--91},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20169},
  doi          = {10.1002/NET.20169},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HarutyunyanM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Hernandez-PerezG07,
  author       = {Hip{\'{o}}lito Hern{\'{a}}ndez{-}P{\'{e}}rez and
                  Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
  title        = {The one-commodity pickup-and-delivery traveling salesman problem:
                  Inequalities and algorithms},
  journal      = {Networks},
  volume       = {50},
  number       = {4},
  pages        = {258--272},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20209},
  doi          = {10.1002/NET.20209},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Hernandez-PerezG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HongC07,
  author       = {Sung{-}Pil Hong and
                  Byung{-}Cheon Choi},
  title        = {Approximability of the \emph{k}-server disconnection problem},
  journal      = {Networks},
  volume       = {50},
  number       = {4},
  pages        = {273--282},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20203},
  doi          = {10.1002/NET.20203},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HongC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LaporteM07,
  author       = {Gilbert Laporte and
                  Inmaculada Rodr{\'{\i}}guez Mart{\'{\i}}n},
  title        = {Locating a cycle in a transportation or a telecommunications network},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {92--108},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20170},
  doi          = {10.1002/NET.20170},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LaporteM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LardeuxNG07,
  author       = {Benoit Lardeux and
                  Dritan Nace and
                  J{\'{e}}r{\^{o}}me Geffard},
  title        = {Multiperiod network design with incremental routing},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {109--117},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20171},
  doi          = {10.1002/NET.20171},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LardeuxNG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LiMB07,
  author       = {Jing{-}Quan Li and
                  Pitu B. Mirchandani and
                  Denis Borenstein},
  title        = {The vehicle rescheduling problem: Model and algorithms},
  journal      = {Networks},
  volume       = {50},
  number       = {3},
  pages        = {211--229},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20199},
  doi          = {10.1002/NET.20199},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LiMB07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LiuHC07,
  author       = {Guizhen Liu and
                  Jianfeng Hou and
                  Jiansheng Cai},
  title        = {Some results about \emph{f}-critical graphs},
  journal      = {Networks},
  volume       = {50},
  number       = {3},
  pages        = {197--202},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20190},
  doi          = {10.1002/NET.20190},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LiuHC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/OrdonezZ07,
  author       = {Fernando Ord{\'{o}}{\~{n}}ez and
                  Jiamin Zhao},
  title        = {Robust capacity expansion of network flows},
  journal      = {Networks},
  volume       = {50},
  number       = {2},
  pages        = {136--145},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20183},
  doi          = {10.1002/NET.20183},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/OrdonezZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/PandaD07,
  author       = {B. S. Panda and
                  Anita Das},
  title        = {On tree 3-spanners in directed path graphs},
  journal      = {Networks},
  volume       = {50},
  number       = {3},
  pages        = {203--210},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20198},
  doi          = {10.1002/NET.20198},
  timestamp    = {Wed, 09 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/PandaD07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ShiCS07,
  author       = {Ning Shi and
                  Raymond K. Cheung and
                  Haiqing Song},
  title        = {On stochastic programs over trees with partially dependent arc capacities},
  journal      = {Networks},
  volume       = {50},
  number       = {2},
  pages        = {157--163},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20185},
  doi          = {10.1002/NET.20185},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ShiCS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/SmilowitzD07,
  author       = {Karen R. Smilowitz and
                  Carlos F. Daganzo},
  title        = {Continuum approximation techniques for the design of integrated package
                  distribution systems},
  journal      = {Networks},
  volume       = {50},
  number       = {3},
  pages        = {183--196},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20189},
  doi          = {10.1002/NET.20189},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/SmilowitzD07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/TengTH07,
  author       = {Yuan{-}Hsiang Teng and
                  Jimmy J. M. Tan and
                  Lih{-}Hsing Hsu},
  title        = {Panpositionable hamiltonicity of the alternating group graphs},
  journal      = {Networks},
  volume       = {50},
  number       = {2},
  pages        = {146--156},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20184},
  doi          = {10.1002/NET.20184},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/TengTH07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/XuYX07,
  author       = {Guang Xu and
                  Yang Yang and
                  Jinhui Xu},
  title        = {Linear time algorithms for approximating the facility terminal cover
                  problem},
  journal      = {Networks},
  volume       = {50},
  number       = {1},
  pages        = {118--126},
  year         = {2007},
  url          = {https://doi.org/10.1002/net.20172},
  doi          = {10.1002/NET.20172},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/XuYX07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.