✦ LIBER ✦

Models and Algorithms for Carsharing Systems and Related Problems

✍ Scribed by Krumke, Sven O.; Quilliot, Alain; Wagler, Annegret K.; Wegener, Jan-Thierry

Book ID: 121829188
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 174 KB
Volume: 44
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.10.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relational models of information-recogni

Relational models of information-recognition problems, algorithms, and systems

✍ A. I. Kondrat'ev 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 372 KB

Models and algorithms for network design

Models and algorithms for network design problems

✍ Poss, Michael 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 84 KB

Improved algorithms for orienteering and

Improved algorithms for orienteering and related problems

✍ Chekuri, Chandra; Korula, Nitish; Pál, Martin 📂 Article 📅 2012 🏛 Association for Computing Machinery 🌐 English ⚖ 333 KB

Algorithms for ℓ1-Embeddability and Rela

Algorithms for ℓ1-Embeddability and Related Problems

✍ Pierre Hansen; Sylvain Perron 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 210 KB

Models and algorithms for fair layout op

Models and algorithms for fair layout optimization problems

✍ Albert E. Fernandes Muritiba; Manuel Iori; Silvano Martello; Marcos J. Negreiros 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 595 KB

DNA Models and Algorithms for NP-Complet

DNA Models and Algorithms for NP-Complete Problems

✍ Eric Bach; Anne Condon; Elton Glaser; Celena Tanguay 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-coloring, which can only be run on small instances and, hence, are not practical. In this pape