The Two Disjoint Path Problem and Wire Routing Design

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-10704-5_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Path Relinking for the Vehicle Routing Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2006English

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

2018English

Cuts and Disjoint Paths in the Valley-Free Path Model

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2006English

Two-Stage Algorithm for Capacitated Vehicle Routing Problem

Journal of Engineering Science and Technology Review
Engineering
2018English

MSDM: Maximally Spatial Disjoint Multipath Routing Protocol for MANET

Communications and Network
2013English

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Heuristic Algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

4OR
MathematicsManagement ScienceManagement Information SystemsComputational TheoryOperations ResearchTheoretical Computer Science
2013English

Two Evolutionary Metaheuristics for the Vehicle Routing Problem With Time Windows

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
1999English

The Hub Location and Routing Problem

Location Science
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy