A Combinatorial Solution for Bridge and Torch Problem

Marilena Jianu (), Mihail Jianu () and Sever Angel Popescu ()
Additional contact information
Marilena Jianu: Technical University of Civil Engineering of Bucharest
Mihail Jianu: University of Oxford
Sever Angel Popescu: Technical University of Civil Engineering of Bucharest

SN Operations Research Forum, 2020, vol. 1, issue 3, 1-7

Abstract: Abstract In this note we give a combinatorial solution to the general case of the puzzle known as “bridge and torch problem”. It is about finding the shortest time needed for n people to cross a bridge knowing that at most two persons can walk together on the bridge (at the speed of the slowest) and, because it is dark, a torch is needed for each crossing (and they have only one torch). The puzzle can be seen (and solved) as a discrete optimization problem.

Keywords: Discrete optimization; Integer programming (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-020-00022-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:1:y:2020:i:3:d:10.1007_s43069-020-00022-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-020-00022-3

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().