Computational Experiments for the Problem of Hamiltonian Path With Fixed Number of Color Repetitions

Advanced Studies in Theoretical Physics - Bulgaria
doi 10.12988/astp.2013.13009
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hikari, Ltd.

Related search

Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem,

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Computational Experiments for the Problem of Footstep Planning for Humanoid Robots

Applied Mathematical Sciences
2013English

Computational Experiments With Some Approximation Algorithms for the Travelling Salesman Problem

Applicationes Mathematicae
1983English

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

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

International Journal of Robust and Nonlinear Control
ControlSystems EngineeringIndustrialMechanical EngineeringElectronic EngineeringManufacturing EngineeringElectricalChemical EngineeringBiomedical EngineeringAerospace Engineering
2011English

Solution of the Sign Problem in the Potts Model at Fixed Fermion Number

Physical Review D
AstronomyPhysics
2018English

A Computational Study on the Number of Iterations to Solve the Transportation Problem

Applied Mathematical Sciences
2014English

A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2017English

Experiments With the Fixed-Parameter Approach for Two-Layer Planarization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy