@article{Cheng-Hu-Jia-Liptak/12,
AUTHOR = {Cheng, Eddie and Hu, Philip and Jia, Roger and Lipt{\'a}k, L{\'a}szl{\'o}},
TITLE = {Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {349-356},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {interconnection networks, perfect matching, bipartite graphs},
URL = {http://dx.doi.org/10.1002/net.20440},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cheng-Hu-Jia-Liptak/12a,
AUTHOR = {Cheng, Eddie and Hu, Philip and Jia, Roger and Lipt{\'a}k, L{\'a}szl{\'o}},
TITLE = {Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {357-364},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {interconnection networks, perfect matching, cayley graphs, hyper-stars},
URL = {http://dx.doi.org/10.1002/net.20441},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gamvros-Gouveia-Raghavan/12,
AUTHOR = {Gamvros, Ioannis and Gouveia, Luis and Raghavan, S.},
TITLE = {Reload cost trees and network design},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {365-379},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {reload costs, network design, integer programming formulations, spanning trees, steiner variants, diameter/hop constraints},
URL = {http://dx.doi.org/10.1002/net.20443},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Feldmann-Roglin-Vocking/12,
AUTHOR = {Feldmann, Andreas Emil and R{\"o}glin, Heiko and V{\"o}cking, Berthold},
TITLE = {Computing approximate Nash equilibria in network congestion games},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {380-386},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {algorithmic game theory, approximate nash equilibria, congestion games},
URL = {http://dx.doi.org/10.1002/net.20444},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bordenave-Gendreau-Laporte/12,
AUTHOR = {Bordenave, Charles and Gendreau, Michel and Laporte, G.},
TITLE = {A branch-and-cut algorithm for the preemptive swapping problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {387-399},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {swapping problem, vehicle routing, branch-and-cut, precedence relationships},
URL = {http://dx.doi.org/10.1002/net.20447},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Berman-Drezner-Krass/11,
AUTHOR = {Berman, Oded and Drezner, Zvi and Krass, Dmitry},
TITLE = {Big segment small segment global optimization algorithm on networks},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {1-11},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {location, networks, global optimization},
URL = {http://dx.doi.org/10.1002/net.20408},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chang-Chang-Hong-Min-Park/11,
AUTHOR = {Chang, Junho and Chang, Soo Y. and Hong, Sung-Pil and Min, Yun-Hong and Park, Myoung-Ju},
TITLE = {Approximation of a batch consolidation problem},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {12-19},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {batch production, minimization of batch number inapproximability, approximation algorithm},
URL = {http://dx.doi.org/10.1002/net.20409},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bermond-Munoz-Sau/11,
AUTHOR = {Bermond, Jean-Claude and Mu{\~n}oz, Xavier and Sau, Ignasi},
TITLE = {Traffic grooming in bidirectional WDM ring networks},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {20-35},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {traffic grooming, sonet adm, optical wdm network, graph decomposition, combinatorial designs},
URL = {http://dx.doi.org/10.1002/net.20410},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Khan-Bhutani/11,
AUTHOR = {Khan, Bilal and Bhutani, Kiran R.},
TITLE = {Compression and expansion in graphs using overlays},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {36-42},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graphs embeddings, diameter, expansion, compression, overlays},
URL = {http://dx.doi.org/10.1002/net.20411},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Barrera-Ferrero/11,
AUTHOR = {Barrera, Roberto and Ferrero, Daniela},
TITLE = {Power domination in cylinders, tori, and generalized Petersen graphs},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {43-49},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {power domination, grid, cylinder, torus, generalized petersen graphs},
URL = {http://dx.doi.org/10.1002/net.20413},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Leus/11,
AUTHOR = {Leus, Roel},
TITLE = {Resource allocation by means of project networks: Dominance results},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {50-58},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {project scheduling, resource constraints, resource allocation},
URL = {http://dx.doi.org/10.1002/net.20414},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Roel_Leus/11,
AUTHOR = {Roel Leus, R.},
TITLE = {Resource allocation by means of project networks: Complexity results},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {59-67},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {project scheduling, resource constraints, resource allocation, complexity},
URL = {http://dx.doi.org/10.1002/net.20415},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Reich-Lopes/11,
AUTHOR = {Reich, Daniel and Lopes, Leo},
TITLE = {The most likely path on series-parallel networks},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {1},
PAGES = {68-80},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {optimization under uncertainty, shortest path, series-parallel, probability bounds},
URL = {http://dx.doi.org/10.1002/net.20416},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Anily-Gendreau-Laporte/11,
AUTHOR = {Anily, Shoshana and Gendreau, Michel and Laporte, Gilbert},
TITLE = {The preemptive swapping problem on a tree},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {83-94},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {swapping problem, stacker crane problem, transshipment},
URL = {http://dx.doi.org/10.1002/net.20451},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Aouchiche-Hansen/11,
AUTHOR = {Aouchiche, Mustapha and Hansen, Pierre},
TITLE = {Proximity and remoteness in graphs: Results and conjectures},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {95-102},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {proximity, remoteness, distance, extremal graph, autographix},
URL = {http://dx.doi.org/10.1002/net.20450},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Arbib-Labbe-Servilio/11,
AUTHOR = {Arbib, Claudio and Labb{\'e}, Martine and Servilio, Mara},
TITLE = {Scheduling two chains of unit jobs on one machine: A polyhedral study},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {103-113},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {one-machine scheduling, convex hull, facet-defining inequalities},
URL = {http://dx.doi.org/10.1002/net.20452},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Crainic-Fu-Gendreau-Rei-Wallace/11,
AUTHOR = {Crainic, Teodor Gabriel and Fu, Xiaorui and Gendreau, Michel and Rei, Walter and Wallace, Stein W.},
TITLE = {Progressive hedging-based metaheuristics for stochastic network design},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {114-124},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {stochastic network design, metaheuristics, progressive hedging, lagrangean relaxation},
URL = {http://dx.doi.org/10.1002/net.20456},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Feremans-Labbe-Letchford-Salazar-Gonzalez/11,
AUTHOR = {Feremans, Corinne and Labb{\'e}, Martine and Letchford, Adam N. and Salazar-Gonz{\'a}lez, Juan-Jos{\'e}},
TITLE = {Generalized network design polyhedra},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {125-136},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {generalized minimum spanning tree problem, generalized traveling salesman problem, polyhedral combinatorics},
URL = {http://dx.doi.org/10.1002/net.20455},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Jaillet-Lu/11,
AUTHOR = {Jaillet, Patrick and Lu, Xin},
TITLE = {Online Traveling Salesman Problems with service flexibility},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {137-146},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {online algorithms, traveling salesman, prize-collecting},
URL = {http://dx.doi.org/10.1002/net.20454},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Puerto-Ricca-Scozzari/11,
AUTHOR = {Puerto, Justo and Ricca, Federica and Scozzari, Andrea},
TITLE = {Minimax regret path location on trees},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {2},
PAGES = {147-158},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {path location, minimax regret optimization, efficient algorithms},
URL = {http://dx.doi.org/10.1002/net.20453},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Groer-Sullivan-Poole/11,
AUTHOR = {Gro{\"e}r, Chris and Sullivan, Blair D. and Poole, Steve},
TITLE = {A mathematical analysis of the R-MAT random graph generator},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {3},
PAGES = {159-170},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {random graph, scale-free graph, r-mat generator, occupancy problem},
URL = {http://dx.doi.org/10.1002/net.20417},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Duarte-Marti-Resende-Silva/11,
AUTHOR = {Duarte, A. and Mart{\'{i}}, R. and Resende, M.G.C. and Silva, R.M.A.},
TITLE = {GRASP with path relinking heuristics for the antibandwidth problem},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {3},
PAGES = {171-189},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {metaheuristics, bandwidth, antibandwidth, grasp, path-relinking, evolutionary path-relinking},
URL = {http://dx.doi.org/10.1002/net.20418},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Alizadeh-Burkard/11,
AUTHOR = {Alizadeh, Behrooz and Burkard, R.E.},
TITLE = {Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {3},
PAGES = {190-200},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network center location, inverse optimization, combinatorial optimization, design of algorithms},
URL = {http://dx.doi.org/10.1002/net.20427},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Balbuena-Gonzalez-moreno-Salas/11,
AUTHOR = {Balbuena, C. and Gonz{\'a}lez-moreno, D. and Salas, J.},
TITLE = {Edge-superconnectivity of semiregular cages with odd girth},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {3},
PAGES = {201-206},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {cage, edge-cut, edge-connectivity, edge-superconnectivity},
URL = {http://dx.doi.org/10.1002/net.20431},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chalopin-Paulusma/11,
AUTHOR = {Chalopin, J{\'e}r{\'e}mie and Paulusma, Dani{\"e}l},
TITLE = {Graph labelings derived from models in distributed computing: A complete complexity classification},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {3},
PAGES = {207-231},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph labeling, graph homomorphism, computational complexity, message-passing, local computation, leader election, naming},
URL = {http://dx.doi.org/10.1002/net.20432},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Johnson-Slater-Walsh/11,
AUTHOR = {Johnson, Peter and Slater, Peter and Walsh, Matt},
TITLE = {The connected hub number and the connected domination number},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {3},
PAGES = {232-237},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {hub, hub number, connected domination, connecting sets},
URL = {http://dx.doi.org/10.1002/net.20433},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Madsen-Ropke/11,
AUTHOR = {Madsen, Oli B.G. and Ropke, Stefan},
TITLE = {ROUTE 2009: Recent advances in vehicle routing optimization},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {239-240},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20468},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Archetti-Bianchessi-Speranza/11,
AUTHOR = {Archetti, C. and Bianchessi, N. and Speranza, M.G.},
TITLE = {A column generation approach for the split delivery vehicle routing problem},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {241-254},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {split delivery vehicle routing problem, unlimited and limited fleet, column generation, branch-and-price-and-cut method},
URL = {http://dx.doi.org/10.1002/net.20467},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Benavent-Corberan-Plana-Sanchis/11,
AUTHOR = {Benavent, Enrique and Corber{\'a}n, Angel and Plana, Isaac and Sanchis, Jos{\'e} M.},
TITLE = {New facets and an enhanced branch-and-cut for the min-max $K$-vehicles windy rural postman problem},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {255-272},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {rural postman problem, windy postman problem, windy rural postman problem, facets, multivehicle},
URL = {http://dx.doi.org/10.1002/net.20469},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Dohn-Rasmussen-Larsen/11,
AUTHOR = {Dohn, Anders and Rasmussen, Matias Sevel and Larsen, Jesper},
TITLE = {The vehicle routing problem with time windows and temporal dependencies},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {273-289},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {vehicle routing with time windows, temporal dependency, generalized precedence constraints, time-window branching, relaxation, column generation, branch-and-price, branch-and-cut-and-price, set partitioning, set covering, integer programming},
URL = {http://dx.doi.org/10.1002/net.20472},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lusby-Larsen/11,
AUTHOR = {Lusby, Richard M. and Larsen, Jesper},
TITLE = {Improved exact method for the double TSP with multiple stacks},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {290-300},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {routing, packing, tsp, k -best solution, longest common subsequence},
URL = {http://dx.doi.org/10.1002/net.20473},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Desaulniers-Desrosiers-Spoorendonk/11,
AUTHOR = {Desaulniers, Guy and Desrosiers, Jacques and Spoorendonk, Simon},
TITLE = {Cutting planes for branch-and-price algorithms},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {301-310},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {integer programming, cutting planes, column generation, dantzig-wolfe decomposition},
URL = {http://dx.doi.org/10.1002/net.20471},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Wen-Krapper-Larsen-Stidsen/11,
AUTHOR = {Wen, Min and Krapper, Emil and Larsen, Jesper and Stidsen, Thomas K.},
TITLE = {A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem},
JOURNAL = {Networks},
VOLUME = {58},
NUMBER = {4},
PAGES = {311-322},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {vehicle routing, driver scheduling, variable neighborhood search, node aggregation},
URL = {http://dx.doi.org/10.1002/net.20470},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Caimi-Fuchsberger-Laumanns-Schupbach/11,
AUTHOR = {Caimi, Gabrio and Fuchsberger, Martin and Laumanns, Marco and Sch{\"u}pbach, Kaspar},
TITLE = {Periodic railway timetabling with event flexibility},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {3-18},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {train scheduling, timetabling, periodic event scheduling problem, flexibility},
URL = {http://dx.doi.org/10.1002/net.20379},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gunkel-Schnee-Muller-Hannemann/11,
AUTHOR = {Gunkel, Thorsten and Schnee, Mathias and M{\"u}ller-Hannemann, Matthias},
TITLE = {How to find good night train connections},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {19-27},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {timetable information system, multi-criteria optimization, night trains, computational study},
URL = {http://dx.doi.org/10.1002/net.20380},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kliewer-Suhl/11,
AUTHOR = {Kliewer, Natalia and Suhl, Leena},
TITLE = {A note on the online nature of the railway delay management problem},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {28-37},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {railway delay management, online optimization, simulation},
URL = {http://dx.doi.org/10.1002/net.20381},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bauer-Delling-Wagner/11,
AUTHOR = {Bauer, Reinhard and Delling, Daniel and Wagner, Dorothea},
TITLE = {Experimental study of speed up techniques for timetable information systems},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {38-52},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph algorithms, shortest paths, algorithm engineering, timetable information, experimental study},
URL = {http://dx.doi.org/10.1002/net.20382},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Moccia-Cordeau-Laporte-Ropke-Valentini/11,
AUTHOR = {Moccia, Luigi and Cordeau, Jean-Fran{\c{c}}ois and Laporte, Gilbert and Ropke, Stefan and Valentini, Maria Pia},
TITLE = {Modeling and solving a multimodal transportation problem with flexible-time and scheduled services},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {53-68},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {multicommodity flow problem, time windows, transportation timetable, multimodal transportation, column generation, nonconvex piecewise linear cost function},
URL = {http://dx.doi.org/10.1002/net.20383},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Acuna-Agost-Michelon-Feillet-Gueye/11,
AUTHOR = {Acuna-Agost, Rodrigo and Michelon, Philippe and Feillet, Dominique and Gueye, Serigne},
TITLE = {A MIP-based local search method for the railway rescheduling problem},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {69-86},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {disruption management, rescheduling, train timetabling, local branching},
URL = {http://dx.doi.org/10.1002/net.20384},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Jacob-Marton-Maue-Nunkesser/11,
AUTHOR = {Jacob, Riko and M{\'a}rton, Peter and Maue, Jens and Nunkesser, Marc},
TITLE = {Multistage methods for freight train classification},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {87-105},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {rail cargo, shunting of rolling stock, sorting algorithms, train classification},
URL = {http://dx.doi.org/10.1002/net.20385},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Busing-Stiller/11,
AUTHOR = {B{\"u}sing, Christina and Stiller, Sebastian},
TITLE = {Line planning, path constrained network flow and inapproximability},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {1},
PAGES = {106-113},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {line planning, network flows, complexity, robustness, planar graphs, bounded treewidth},
URL = {http://dx.doi.org/10.1002/net.20386},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Huang-Shan/11,
AUTHOR = {Huang, Shenwei and Shan, Erfang},
TITLE = {A note on the upper bound for the paired-domination number of a graph with minimum degree at least two},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {115-116},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {paired-domination number, upper bound, minimum degree},
URL = {http://dx.doi.org/10.1002/net.20390},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Joret/11,
AUTHOR = {Joret, Gwena{\"e}},
TITLE = {Stackelberg network pricing is hard to approximate},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {117-120},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {combinatorial optimization, apx-hardness, network pricing, stackelberg games},
URL = {http://dx.doi.org/10.1002/net.20391},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Araujo-Pardo-Balbuena/11,
AUTHOR = {Araujo-Pardo, G. and Balbuena, Camino},
TITLE = {Constructions of small regular bipartite graphs of girth 6},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {121-127},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {incidence matrices, latin squares, projective plane, girth, cage},
URL = {http://dx.doi.org/10.1002/net.20392},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Yu-Liu/11,
AUTHOR = {Yu, Wei and Liu, Zhaohui},
TITLE = {Single-vehicle scheduling problems with release and service times on a line},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {128-134},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {vehicle routing, vehicle scheduling, approximation algorithm},
URL = {http://dx.doi.org/10.1002/net.20393},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kalinowski/11,
AUTHOR = {Kalinowski, Thomas},
TITLE = {A minimum cost flow formulation for approximated MLC segmentation},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {135-140},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {intensity modulated radiation therapy, multileaf collimator, minimum cost flows},
URL = {http://dx.doi.org/10.1002/net.20394},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Raack-Koster-Orlowski-Wessaly/11,
AUTHOR = {Raack, Christian and Koster, Arie M.C.A. and Orlowski, Sebastian and Wess{\"a}ly, Roland},
TITLE = {On cut-based inequalities for capacitated network design polyhedra},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {141-156},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {capacitated network design, cutset polyhedra, flow-cutset inequalities, cut residual capacity inequalities, integer programming, mixed-integer rounding sndlib},
URL = {http://dx.doi.org/10.1002/net.20395},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Harutyunyan-Liestman-Makino-Shermer/11,
AUTHOR = {Harutyunyan, Hovhannes A. and Liestman, Arthur L. and Makino, Kazuhisa and Shermer, Thomas C.},
TITLE = {Nonadaptive broadcasting in trees},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {157-168},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {broadcasting, path, tree, universal list, nonadaptive},
URL = {http://dx.doi.org/10.1002/net.20396},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ruzika-Sperber-Steiner/11,
AUTHOR = {Ruzika, Stefan and Sperber, Heike and Steiner, Mechthild},
TITLE = {Earliest arrival flows on series-parallel graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {169-173},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {dynamic network flows, earliest arrival flows, universally maximal dynamic flows, discrete time setting, series-parallel graphs, polynomial algorithms},
URL = {http://dx.doi.org/10.1002/net.20398},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gitler-Sagols/11,
AUTHOR = {Gitler, Isidoro and Sagols, Feli{\'u}},
TITLE = {On terminal delta-wye reducibility of planar graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {174-186},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {delta-wye transformations, medial graph, planar graphs, topological graph theory},
URL = {http://dx.doi.org/10.1002/net.20399},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Havill-Hutson/11,
AUTHOR = {Havill, Jessen T. and Hutson, Kevin R.},
TITLE = {Optimal online ring routing},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {2},
PAGES = {187-197},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {routing, ring networks, online algorithms},
URL = {http://dx.doi.org/10.1002/net.20400},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Detti-Nicosia-Pacifici-Servilio/11,
AUTHOR = {Detti, Paolo and Nicosia, Gaia and Pacifici, Andrea and Servilio, Mara},
TITLE = {Optimal power control in OFDMA cellular networks},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {200-211},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {radio resource allocation, network flow, heuristic algorithm},
URL = {http://dx.doi.org/10.1002/net.20429},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{de_Souza-Cavalcante/11,
AUTHOR = {de Souza, Cid C. and Cavalcante, Victor F.},
TITLE = {Exact algorithms for the vertex separator problem in graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {212-230},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {lagrangian relaxation, cutting planes, integer programming, relax-and-cut, vertex separator},
URL = {http://dx.doi.org/10.1002/net.20420},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cacchiani-Muritiba-Negreiros-Toth/11,
AUTHOR = {Cacchiani, Valentina and Muritiba, Albert Einstein Fernandes and Negreiros, Marcos and Toth, Paolo},
TITLE = {A multistart heuristic for the equality generalized Traveling Salesman Problem},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {231-239},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {generalized traveling salesman problem, metaheuristic, layered network, computational experiments},
URL = {http://dx.doi.org/10.1002/net.20421},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Maurras-Stephan/11,
AUTHOR = {Maurras, Jean Fran{\c{c}}ois and Stephan, R{\"u}diger},
TITLE = {On the cardinality constrained matroid polytope},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {240-246},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {matroid polytpe, cardinality constraints, facets, separation},
URL = {http://dx.doi.org/10.1002/net.20430},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Aloisio-Arbib-Marinelli/11,
AUTHOR = {Aloisio, Alessandro and Arbib, Claudio and Marinelli, Fabrizio},
TITLE = {On LP relaxations for the pattern minimization problem},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {247-253},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {cutting stock, integer decomposition, linear relaxations},
URL = {http://dx.doi.org/10.1002/net.20422},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Amaldi-Galbiati-Maffioli/11,
AUTHOR = {Amaldi, Edoardo and Galbiati, Giulia and Maffioli, Francesco},
TITLE = {On minimum reload cost paths, tours, and flows},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {254-260},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network optimization, extended reload cost model, computational complexity},
URL = {http://dx.doi.org/10.1002/net.20423},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Machado-de_Figueiredo/11,
AUTHOR = {Machado, Raphael C.S. and de Figueiredo, Celina M.H.},
TITLE = {A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {261-269},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {total-coloring, list-total-coloring, graph decompositions, partial-grids, outerplanar graphs},
URL = {http://dx.doi.org/10.1002/net.20424},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Eggenberg-Salani-Bierlaire/11,
AUTHOR = {Eggenberg, Niklaus and Salani, Matteo and Bierlaire, Michel},
TITLE = {Uncertainty feature optimization: An implicit paradigm for problems with noisy data},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {270-284},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {optimization under uncertainty, robustness, recoverability},
URL = {http://dx.doi.org/10.1002/net.20428},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bampas-Pagourtzis-Potika/11,
AUTHOR = {Bampas, Evangelos and Pagourtzis, Aris and Potika, Katerina},
TITLE = {An experimental study of maximum profit wavelength assignment in WDM rings},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {285-293},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {ring networks, optical networks, wdm, wavelength assignment, maximum profit, approximation algorithms, experimental evaluation},
URL = {http://dx.doi.org/10.1002/net.20425},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lari-Ricca-Scozzari-Becker/11,
AUTHOR = {Lari, Isabella and Ricca, Federica and Scozzari, Andrea and Becker, Ronald I.},
TITLE = {Locating median paths on connected outerplanar graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {3},
PAGES = {294-307},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {path location, median path, outerplanar graphs},
URL = {http://dx.doi.org/10.1002/net.20426},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Penso-Rautenbach-Szwarcfiter/11,
AUTHOR = {Penso, Lucia Draque and Rautenbach, Dieter and Szwarcfiter, Jayme Luiz},
TITLE = {Connectivity and diameter in distance graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {310-315},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {circulant graph, distance graph, multiple loop networks, connectivity, diameter},
URL = {http://dx.doi.org/10.1002/net.20397},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gomez-Fabrega-Yebra/11,
AUTHOR = {G{\'o}mez, J. and F{\`a}brega, J. and Yebra, J.L.A.},
TITLE = {On large $(\Delta, D, D, 1)$-graphs},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {316-327},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {interconnection networks, large graphs, compound graphs, product of graphs, vulnerability, ($\delta$, d, d', s)-problem},
URL = {http://dx.doi.org/10.1002/net.20401},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hamina-Peltola/11,
AUTHOR = {Hamina, Martti and Peltola, Matti},
TITLE = {Least central subtrees, center, and centroid of a tree},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {328-332},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {center, centroid, tree eccentricity, joinsemilattice of subtrees, least central subtree},
URL = {http://dx.doi.org/10.1002/net.20402},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kabacinski-Wichary/11,
AUTHOR = {Kabaci{\'n}ski, Wojciech and Wichary, Tomasz},
TITLE = {Nonblocking multirate $\log_2(N,m,p)$ switching networks with multicast connections},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {333-343},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {log2(n,m,p), networks, multirate, multicast, wide-sense nonblocking networks (wsnb), window algorithm},
URL = {http://dx.doi.org/10.1002/net.20403},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Damaschke/11,
AUTHOR = {Damaschke, Peter},
TITLE = {Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {344-350},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {learning by queries, degree sequence, sampling, sparse graph, dominating set},
URL = {http://dx.doi.org/10.1002/net.20404},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kriesell/11,
AUTHOR = {Kriesell, Matthias},
TITLE = {Balancing two spanning trees},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {351-353},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {factorization, spanning tree, tree packing, balance, henneberg sequence},
URL = {http://dx.doi.org/10.1002/net.20405},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Thomas-Prendergast-Weng/11,
AUTHOR = {Thomas, Doreen and Prendergast, Kevin and Weng, Jia},
TITLE = {Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint $1\leq m \leq \sqrt{3}$},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {354-361},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {minimum networks, gradient-constrained networks, steiner trees, locally minimal},
URL = {http://dx.doi.org/10.1002/net.20406},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Sun/11a,
AUTHOR = {Sun, Minghe},
TITLE = {Finding integer efficient solutions for multiple objective network programming problems},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {362-375},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network flow algorithms, multiple objective programming, multiple criteria decision making, integer programming},
URL = {http://dx.doi.org/10.1002/net.20407},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Zenklusen-Laumanns/11,
AUTHOR = {Zenklusen, Rico and Laumanns, Marco},
TITLE = {High-confidence estimation of small $s-t$ reliabilities in directed acyclic networks},
JOURNAL = {Networks},
VOLUME = {57},
NUMBER = {4},
PAGES = {376-388},
YEAR = {2011},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {s-t reliability, ($\epsilon$,$\delta$)-approximations, monte carlo algorithms, importance sampling},
URL = {http://dx.doi.org/10.1002/net.20412},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}