Approximation Algorithms and Heuristics for a 2-Depot, Heterogeneous Hamiltonian Path Problem

International Journal of Robust and Nonlinear Control - United States
doi 10.1002/rnc.1701
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Approximation Algorithms for the Shortest Superstring Problem.

English

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

Improved Approximation Algorithms for Firefighter Problem on Trees

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2011English

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Deterministic Approximation Algorithm for Maximum 2-Path Packing

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Approximation Algorithms Design for Disk Partial Covering Problem

2004English

PASS Approximation: A Framework for Analyzing and Designing Heuristics

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem,

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy