| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arie M. C. A. Koster, Manuel Kutschka, Christian Raack |
Robust network design: Formulations, valid inequalities, and computations.  |
Networks  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy |
A branch-and-cut algorithm for the ring spur assignment problem. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | John Penuel, J. Cole Smith, Siqian Shen |
Integer programming models and algorithms for the graph decontamination problem with mobile agents. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Poss, Christian Raack |
Affine recourse for the robust network design problem: Between static and dynamic routing. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Katherine C. Hastings, Douglas R. Shier |
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano |
On the super-restricted arc-connectivity of s -geodetic digraphs. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Leitner, Mario Ruthmair, Günther R. Raidl |
Stabilizing branch-and-price for constrained tree problems. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza |
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristan, Maria Saumell |
Proximity graphs inside large weighted graphs. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Cruz López-de-los-Mozos, Justo Puerto, Antonio M. Rodríguez-Chía |
Robust mean absolute deviation problems on networks with linear vertex weights. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Stefan Voß |
Editorial. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Günes Erdogan, Gilbert Laporte |
The orienteering problem with variable profits. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa |
Hop-level flow formulation for the survivable network design with hop constraints problem. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, James B. Orlin |
Simplifications and speedups of the pseudoflow algorithm. |
Networks |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Côté, Michel Gendreau, Jean-Yves Potvin |
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Klopfenstein, Dritan Nace |
Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin |
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti |
Bidirectional A* search on time-dependent road networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Orlowski, Michal Pióro |
Complexity of column generation in network design with path-based survivability mechanisms. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Raymond Greenlaw, Sanpawat Kantabutra, Pattama Longani |
A mobility model for studying wireless communication and the complexity of problems in the model. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Siqian Shen, J. Cole Smith |
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernardetta Addis, Giuliana Carello, Alberto Ceselli |
Exactly solving a two-level location problem with modular node capacities. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman |
Survivability in hierarchical telecommunications networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, R. Ravi |
Approximation algorithms for distance constrained vehicle routing problems. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Aysegül Altin, Bernard Fortz, Hakan Ümit |
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri |
Optimal gossiping in geometric radio networks in the presence of dynamical faults. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Büsing |
Recoverable robust shortest path problems. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sajal K. Das, Giacomo Ghidini, Alfredo Navarra, Maria Cristina Pinotti |
Localization and scheduling protocols for actor-centric sensor networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
Bottleneck links, variable demand, and the tragedy of the commons. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Balachandran Vaidyanathan |
Simple linear flow decomposition algorithms on trees, circles, and augmented trees. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Chie Morisaka |
Completely independent spanning trees in torus networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo Adasme, Abdel Lisser, Ismael Soto |
A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Uchoa, Túlio A. M. Toffolo, Maurício C. de Souza, Alexandre Xavier Martins, Ricardo Fukasawa |
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Kamma, Zeev Nutov |
Approximating survivable networks with minimum number of steiner points. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura |
The complexity of the node capacitated in-tree packing problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmytro Matsypura, Vadim G. Timkovsky |
Margining option portfolios by network flows. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Irene Finocchi |
Editorial: Preface to the special issue. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jordi Castro, Jordi Cuesta |
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Bordenave, Michel Gendreau, Gilbert Laporte |
A branch-and-cut algorithm for the preemptive swapping problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor |
The load-distance balancing problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Darko Skorin-Kapov, Jadranka Skorin-Kapov |
A note on Steiner tree games. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Mohamed Didi Biha |
On the minimum cut separator problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Teresa Almeida, Filipa D. Carvalho |
Integer models and upper bounds for the 3-club problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati |
Succinct greedy drawings do not always exist. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Maria Grazia Scutellà |
Editorial. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Gamvros, Luis Gouveia, S. Raghavan |
Reload cost trees and network design. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Serafini, Bruno Simeone |
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser |
On a stochastic bilevel programming problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic, Peter Putz, Juan José Salazar González |
Exact approaches to the single-source network loading problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peteris Daugulis |
A note on a generalization of eigenvector centrality for bipartite graphs and applications. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking |
Computing approximate Nash equilibria in network congestion games. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Donatella Firmani, Luigi Laura |
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Salmerón |
Deception tactics for network interdiction: A multiobjective approach. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas S. Altner, J. Paul Brooks |
Coverings and matchings in r-partite hypergraphs. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari, Paolo Serafini |
Network flow methods for electoral systems. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor López Millán, Vicent Cholvi, Luis López, Antonio Fernández Anta |
A model of self-avoiding random walks for searching complex networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Ruzika, Markus Thiemann |
Min-Max quickest path problems. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce L. Golden, Douglas R. Shier |
Editorial: 2010 Glover-Klingman prize winners. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Duhamel, Luís Gouveia, Pedro Moura, Maurício C. de Souza |
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carol A. Meyers, Andreas S. Schulz |
The complexity of welfare maximization in congestion games. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alf Kimms, Klaus-Christian Maassen |
A fast heuristic approach for large-scale cell-transmission-based evacuation route planning. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele G. Fusco, Andrzej Pelc |
Distributed tree comparison with nodes of limited memory. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dajin Wang |
Constructing optimal subnetworks for the crossed cube network. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eddie Cheng, Philip Hu, Roger Jia, László Lipták |
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | André Rossi, Alok Singh, Marc Sevaux |
Column generation algorithm for sensor coverage scheduling under bandwidth constraints. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Babacar Thiongane |
Lagrangean decomposition/relaxation for the routing and wavelength assignment problem. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Ronald J. Gould, Jeffrey S. Powell |
Property Pd, m and efficient design of reliable networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingo Gomez-Perez, Jaime Gutierrez, Álvar Ibeas |
Connectedness of finite distance graphs. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Pelc |
Deterministic rendezvous in networks: A comprehensive survey. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eddie Cheng, Philip Hu, Roger Jia, László Lipták |
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Briest, Luciano Gualà, Martin Hoefer, Carmine Ventre |
On stackelberg pricing with computationally bounded customers. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred R. McMorris, Henry Martyn Mulder, Oscar Ortega |
The ℓp-function on trees. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Kalinowski |
A minimum cost flow formulation for approximated MLC segmentation. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Büsing, Sebastian Stiller |
Line planning, path constrained network flow and inapproximability. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Ruzika, Heike Sperber, Mechthild Steiner |
Earliest arrival flows on series-parallel graphs. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isidoro Gitler, Feliu Sagols |
On terminal delta-wye reducibility of planar graphs. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oli B. G. Madsen, Stefan Ropke |
ROUTE 2009: Recent advances in vehicle routing optimization. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thorsten Gunkel, Mathias Schnee, Matthias Müller-Hannemann |
How to find good night train connections. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Natalia Kliewer, Leena Suhl |
A note on the online nature of the railway delay management problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park |
Approximation of a batch consolidation problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Jaillet, Xin Lu |
Online traveling salesman problems with service flexibility. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret |
Stackelberg network pricing is hard to approximate. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva |
GRASP with path relinking heuristics for the antibandwidth problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Evangelos Bampas, Aris Pagourtzis, Katerina Potika |
An experimental study of maximum profit wavelength assignment in WDM rings. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza |
A column generation approach for the split delivery vehicle routing problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth |
A multistart heuristic for the equality generalized traveling salesman problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio |
Optimal power control in OFDMA cellular networks. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roel Leus |
Resource allocation by means of project networks: Dominance results. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodrigo Acuna-Agost, Philippe Michelon, Dominique Feillet, Serigne Gueye |
A MIP-based local search method for the railway rescheduling problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Connectivity and diameter in distance graphs. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González |
Generalized network design polyhedra. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cid C. de Souza, Victor F. Cavalcante |
Exact algorithms for the vertex separator problem in graphs. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shoshana Anily, Michel Gendreau, Gilbert Laporte |
The preemptive swapping problem on a tree. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis |
New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Justo Puerto, Federica Ricca, Andrea Scozzari |
Minimax regret path location on trees. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter D. Johnson Jr., Peter Slater, Matt Walsh |
The connected hub number and the connected domination number. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Doreen A. Thomas, Kevin Prendergast, Jia F. Weng |
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies 1 <= m <= sqrt(3). |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Bauer, Daniel Delling, Dorothea Wagner |
Experimental study of speed up techniques for timetable information systems. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael C. S. Machado, Celina M. Herrera de Figueiredo |
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jessen T. Havill, Kevin R. Hutson |
Optimal online ring routing. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")