Complexity and Approximability of the k-Way Vertex CutBERGER, André; GRIGORIEV, Alexander; VAN DER ZWAAN, Ruben et al.Networks (New York, NY). 2014, Vol 63, Num 2, pp 170-178, issn 0028-3045, 9 p.Article

Nonexistence of Optimal Graphs for All Terminal ReliabilityBROWN, J. I; COX, D.Networks (New York, NY). 2014, Vol 63, Num 2, pp 146-153, issn 0028-3045, 8 p.Article

A Flow-Dependent Quadratic Steiner Tree Problem in the Euclidean PlaneBRAZIL, Marcus N; RAS, Charl J; THOMAS, Doreen A et al.Networks (New York, NY). 2014, Vol 64, Num 1, pp 18-28, issn 0028-3045, 11 p.Article

Cooperative Covering Problems on NetworksAVERBAKH, Igor; BERMAN, Oded; KRASS, Dmitry et al.Networks (New York, NY). 2014, Vol 63, Num 4, pp 334-349, issn 0028-3045, 16 p.Article

Integrated Network Design and Scheduling Problems with Parallel Identical Machines: Complexity Results and Dispatching RulesNURRE, Sarah G; SHARKEY, Thomas C.Networks (New York, NY). 2014, Vol 63, Num 4, pp 306-326, issn 0028-3045, 21 p.Article

Special Issue on Graph Algorithms and OptimizationCERULLI, Raffaele; GENTILI, Monica.Networks (New York, NY). 2014, Vol 64, Num 4, issn 0028-3045, 126 p.Conference Proceedings

Finding Least Fuel Emission Paths in a Network with Time-Varying SpeedsJIANI QIAN; EGLESE, Richard.Networks (New York, NY). 2014, Vol 63, Num 1, pp 96-106, issn 0028-3045, 11 p.Conference Paper

Integrated Job Scheduling and Network RoutingGAMST, Mette; PISINGER, David.Networks (New York, NY). 2013, Vol 61, Num 3, pp 248-262, issn 0028-3045, 15 p.Article

A Survey of Resource Constrained Shortest Path Problems: Exact Solution ApproachesDI PUGLIA PUGLIESE, Luigi; GUERRIERO, Francesca.Networks (New York, NY). 2013, Vol 62, Num 3, pp 183-200, issn 0028-3045, 18 p.Article

Decomposition Algorithms for Solving the Minimum Weight Maximal Matching ProblemBODUR, Merve; EKIM, Tinaz; TASKIN, Z. Caner et al.Networks (New York, NY). 2013, Vol 62, Num 4, pp 273-287, issn 0028-3045, 15 p.Article

Local versus Global Search in Channel GraphsHUNTER, A. H; PIPPENGER, Nicholas.Networks (New York, NY). 2013, Vol 62, Num 1, pp 27-34, issn 0028-3045, 8 p.Article

A Mathematical Analysis of the R-MAT Random Graph GeneratorGROER, Chris; SULLIVAN, Blair D; POOLE, Steve et al.Networks (New York, NY). 2011, Vol 58, Num 3, pp 159-170, issn 0028-3045, 12 p.Article

Earliest Arrival Flows on Series-Parallel GraphsRUZIKA, Stefan; SPERBER, Heike; STEINER, Mechthild et al.Networks (New York, NY). 2011, Vol 57, Num 2, pp 169-173, issn 0028-3045, 5 p.Article

On Large (A, D, D, 1)-GraphsGOMEZ, J; FABREGA, J; YEBRA, J. L. A et al.Networks (New York, NY). 2011, Vol 57, Num 4, pp 316-327, issn 0028-3045, 12 p.Article

Special issue on Optimization in Scheduled Transportation NetworkdAHUJA, Ravindra K; LIEBCHEN, Christian.Networks (New York, NY). 2011, Vol 57, Num 1, issn 0028-3045, 114 p.Serial Issue

A MIP-based Local Search Method for the Railway Rescheduling ProblemACUNA-AGOST, Rodrigo; MICHELON, Philippe; FEILLET, Dominique et al.Networks (New York, NY). 2011, Vol 57, Num 1, pp 69-86, issn 0028-3045, 18 p.Article

A Column Generation Approach for the Split Delivery Vehicle Routing ProblemARCHETTI, C; BIANCHESSI, N; SPERANZA, M. G et al.Networks (New York, NY). 2011, Vol 58, Num 4, pp 241-254, issn 0028-3045, 14 p.Conference Paper

A Multilevel Variable Neighborhood Search Heuristic for a Practical Vehicle Routing and Driver Scheduling ProblemMIN WEN; KRAPPER, Emil; LARSEN, Jesper et al.Networks (New York, NY). 2011, Vol 58, Num 4, pp 311-322, issn 0028-3045, 12 p.Conference Paper

Improved Exact Method for the Double TSP with Multiple StacksLUSBY, Richard M; LARSEN, Jesper.Networks (New York, NY). 2011, Vol 58, Num 4, pp 290-300, issn 0028-3045, 11 p.Conference Paper

The Vehicle Routing Problem with Time Windows and Temporal DependenciesDOHN, Anders; SEVEL RASMUSSEN, Matias; LARSEN, Jesper et al.Networks (New York, NY). 2011, Vol 58, Num 4, pp 273-289, issn 0028-3045, 17 p.Conference Paper

An Ejection Chain Algorithm for the Quadratic Assignment ProblemREGO, Cesar; JAMES, Tabitha; GLOVER, Fred et al.Networks (New York, NY). 2010, Vol 56, Num 3, pp 188-206, issn 0028-3045, 19 p.Article

Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its DualJIONG GUO; NIEDERMEIER, Rolf; WERNICKE, Sebastian et al.Networks (New York, NY). 2010, Vol 56, Num 2, pp 116-130, issn 0028-3045, 15 p.Article

Linearly Many Faults in 2-Tree-Generated NetworksCHENG, Eddie; LIPTAK, László; SALA, Fred et al.Networks (New York, NY). 2010, Vol 55, Num 2, pp 90-98, issn 0028-3045, 9 p.Article

Network Flow SpannersDRAGAN, Feodor F; CHENYU YAN.Networks (New York, NY). 2010, Vol 56, Num 3, pp 159-168, issn 0028-3045, 10 p.Article

On Superconnectivity of (4,g)-Cages with Even GirthYUQING LIN; HONGLIANG LU; YUNJIAN WU et al.Networks (New York, NY). 2010, Vol 56, Num 2, pp 143-148, issn 0028-3045, 6 p.Article