Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 41
Volume 41, June 2013
- Hipólito Hernández-Pérez, Jorge Riera-Ledesma
, Inmaculada Rodríguez Martín, Juan José Salazar González:
International Network Optimization Conference, Tenerife 2013. 1-3 - Rafael Castro de Andrade, Adriano Tavares de Freitas:
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds. 5-12 - Julia Sender, Uwe Clausen:
Heuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic. 13-20 - Markus Chimani, Maria Kandyba, Maren Martens:
2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions. 21-28 - Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser:
A polynomial formulation for the stochastic maximum weight forest problem. 29-36 - J. Fabian Meier, Uwe Clausen:
Strategic planning in LTL logistics - increasing the capacity utilization of trucks. 37-44 - Robert Voll, Uwe Clausen:
Branch-and-Price for a European variant of the Railroad Blocking Problem. 45-52 - Paola Cappanera, Maria Grazia Scutellà:
Home Care optimization: impact of pattern generation policies on scheduling and routing decisions. 53-60 - Walid Ben-Ameur, Mateusz Zotkiewicz:
Multipolar routing: where dynamic and static routing meet. 61-68 - Arie Koster, Truong Khoa Phan, Martin Tieves:
Extended Cutset Inequalities for the Network Power Consumption Problem. 69-76 - Fabián Castaño, André Rossi, Marc Sevaux, Nubia Velasco:
On the use of multiple sinks to extend the lifetime in connected wireless sensor networks. 77-84 - Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg:
A Flow Formulation for the Optimum Communication Spanning Tree. 85-92 - George Geranis, Angelo Sifaleras:
Dynamic trees in exterior-point Simplex-type algorithms for network flow problems. 93-100 - David Raz, Shira Levy:
A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes. 101-108 - Wataru Kishimoto:
An Extension of a Balanced Flow in a Network. 109-116 - Bernard Fortz, Martine Labbé, Alessia Violin:
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. 117-124 - Alberto Coppi, Paolo Detti, Jessica Raffaelli:
A planning and routing model for patient transportation in health care. 125-132 - Mateusz Zotkiewicz:
Efficient MIP formulation for optimal 1-for-N diversity coding. 133-140 - Hamida Seba, Riadh Khennoufa:
Edge Coloring by Total Labelings of 4-regular Circulant Graphs. 141-148 - Ariel Waserhole, Vincent Jost, Nadia Brauner:
Pricing techniques for self regulation in Vehicle Sharing Systems. 149-156 - Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
Approximating the Lovász θ Function with the Subgradient Method. 157-164 - Zhiyuan Lin, Raymond S. K. Kwan:
An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling. 165-172 - Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. 173-180 - Markus Leitner, Ivana Ljubic, Markus Sinnl:
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. 181-188 - Andreas Bley, Daniel Karch, Fabio D'Andreagiovanni:
WDM Fiber Replacement Scheduling. 189-196 - Yuan Li, Michal Pióro:
Integer programming models for maximizing parallel transmissions in wireless networks. 197-204 - Fabio Furini, Martin Philip Kidd:
A fast heuristic approach for train timetabling in a railway node. 205-212 - Lena Hupp, Frauke Liers:
A polyhedral study of the Hamiltonian p-median problem. 213-220 - Pablo Romero, Franco Robledo, Pablo Rodríguez-Bocca, Claudia Rostagnol:
Mathematical Analysis of caching policies and cooperation in YouTube-like services. 221-228 - Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs. 229-236 - Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid:
An Interval Assignment Problem for Resource Optimization in LTE Networks. 237-244 - Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic Survivable Network Design Problems. 245-252 - Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat:
Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach. 253-260 - Odivaney Pedro, Rodney Rezende Saldanha, Ricardo Saraiva de Camargo:
A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem. 261-268 - Francisco Ángel-Bello, Iris Martínez-Salazar, Ada M. Alvarez:
Minimizing waiting times in a route design problem with multiple use of a single vehicle. 269-276 - Daniel Morais dos Reis, Thiago F. Noronha, Sérgio Ricardo de Souza:
Iterated Local Search for Fiber Installation in Optical Network Optimization. 277-284 - Hasan Murat Afsar, Nacima Labadie:
Team Orienteering Problem with Decreasing Profits. 285-293 - Bradley J. Paynter, Douglas R. Shier:
A Network Approach to a Geometric Packing Problem. 295-302 - Sara Mattia:
The cut condition for robust network design. 303-310 - Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. 311-318 - Idil Arsik, F. Sibel Salman:
Modeling Earthquake Vulnerability of Highway Networks. 319-326 - Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza:
Intersecting a simple mixed integer set with a vertex packing set. 327-334 - Cédric Hervet, Alain Faye, Marie-Christine Costa, Matthieu Chardy, Stanislas Francfort:
Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. 335-342 - S. P. van Loggerenberg, Magdalena J. Grobler, S. E. Terblanche:
Solving the Passive Optical Network with Fiber Duct Sharing Planning Problem Using Discrete Techniques. 343-350 - Amaro de Sousa, Carlos B. Lopes, Dorabella Santos:
Load balancing optimization of telecommunication networks with two differentiated services. 351-358 - Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
On the Two-Architecture Connected Facility Location Problem. 359-366 - Bernard Gendron, Rosario Giuseppe Garroppo, Gianfranco Nencioni, Maria Grazia Scutellà, Luca Tavanti:
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks. 367-374 - Richard Li-Yang Chen, Cynthia A. Phillips:
k-Edge Failure Resilient Network Design. 375-382 - Alessandra Cornaro, Gian Paolo Clemente:
A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques. 383-390 - Valentina Cacchiani, Juan José Salazar González:
A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem. 391-398 - Sergio Consoli, José Andrés Moreno-Pérez, Nenad Mladenovic:
Intelligent variable neighbourhood search for the minimum labelling spanning tree problem. 399-406 - Qing Xu, Frédéric Lassabe, Hakim Mabed, Alexandre Caminada:
Fitness Landscape Analysis for Scalable Multicast RRM Problem in Cellular Network. 407-414 - Vinicius Leal do Forte, Abilio Lucena, Nelson Maculan:
Formulations for the Minimum 2-Connected Dominating Set Problem. 415-422 - Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Formulating and Solving the Minimum Dominating Cycle Problem. 423-430 - Marie-José Huguet, Dominik Kirchler, Pierre Parent, Roberto Wolfler Calvo:
Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem. 431-437 - Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
On the Hardness of Equal Shortest Path Routing. 439-446 - Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
(k, c) - coloring via Column Generation. 447-454 - Artur Tomaszewski:
The final answer to the complexity of a basic problem in resilient network design. 455-462 - Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
IP modeling of the survivable hop constrained connected facility location problem. 463-470 - Hanane Allaoua, Sylvie Borne, Lucas Létocart, Roberto Wolfler Calvo:
A matheuristic approach for solving a home health care problem. 471-478 - Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Network Design using Bin-Packing. 479-486 - Sylvie Borne, Ali Ridha Mahjoub, Raouia Taktak:
A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints. 487-494 - Luigi De Giovanni, Claudio E. Palazzi:
Optimal Client-Server Configuration of Mobile Ad-Hoc Networks. 495-502 - William J. Guerrero, Nubia Velasco, Caroline Prodhon, Ciro-Alberto Amaya:
On the Generalized Elementary Shortest Path Problem: A heuristic approach. 503-510 - Jianqiang Cheng, Abdel Lisser, Marc Letournel:
Distributionally robust stochastic shortest path problem. 511-518 - Adrian Bock, Laura Sanità:
On the approximability of two capacitated vehicle routing problems. 519-526 - Massinissa Merabet, Sylvain Durand, Miklós Molnár:
Exact solution for branch vertices constrained spanning problems. 527-534 - Sílvia M. D. M. Maia, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
On the Biobjective Adjacent Only Quadratic Spanning Tree Problem. 535-542 - Edoardo Amaldi, Stefano Coniglio, Luca Giovanni Gianoli, Can Umut Ileri:
On single-path network routing subject to max-min fair flow allocation. 543-550 - Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub:
Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. 551-558 - Leonardo Lamorgese, Carlo Mannino:
The track formulation for the Train Dispatching problem. 559-566
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-05-10 19:43 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:
