✦ LIBER ✦

Solving the Hamiltonian path problem with a light-based computer

✍ Scribed by Mihai Oltean

Publisher: Springer Netherlands
Year: 2007
Tongue: English
Weight: 287 KB
Volume: 7
Category: Article
ISSN: 1567-7818
DOI: 10.1007/s11047-007-9042-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the subset-sum problem with a li

Solving the subset-sum problem with a light-based device

✍ Mihai Oltean; Oana Muntean 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 218 KB

Solving the generalized Subset Sum probl

Solving the generalized Subset Sum problem with a light based device

✍ Masud Hasan; Shabab Hossain; Md. Mahmudur Rahman; M. Sohel Rahman 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 352 KB

Solving the undirected multicommodity fl

Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm

✍ Richard D. McBride; John W. Mamer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

Solving the -shortest path problem with

Solving the -shortest path problem with time windows in a time varying network

✍ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const

A method of solving the travelling sales

A method of solving the travelling salesman problem with the help of integer programming: The problem of finding Hamilton paths of the shortest length in a complete graph

✍ V.I. Mudrov 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 249 KB

A library of problem-solving components

A library of problem-solving components based on the integration of the search paradigm with task and method ontologies

✍ ENRICO MOTTA; ZDENEK ZDRAHAL 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 601 KB

In this paper we investigate the reuse of tasks and problem-solving methods and we propose a model of how to organize a library of reusable components for knowledgebased systems. In our approach, we first describe a class of problems by means of a task ontology. Then we instantiate a generic model o