A combinatorial solution for bridge and torch problem

DOI10.1007/S43069-020-00022-3MaRDI QIDQ2226477zbMATH OpenOpenAlexFDO

Authors Marilena Jianu, Mihail Jianu, Sever Angel Popescu

Publication date 8 February 2021

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s43069-020-00022-3

zbMATH Keywords

integer programmingdiscrete optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• The solution and applications of a combinatorial problem
• A branch-and-cut approach to the crossing number problem
• A solution of the Steinhaus's combinatorial problem
• On a new principle for solving combinatorial problems
• scientific article; zbMATH DE number 4213934
• Publication:5753965
• Solvable cases of a new combinatorial problem of optimization
• Combinatorial Benders cuts for the minimum tollbooth problem
• Solving a combinatorial problem with network flows
• On a combinatorial search problem

Cites work

• scientific article; zbMATH DE number 5604072 (Why is no real title available?)
• Escape from Zurg: an exercise in logic programming
• The Capacity-C Torch Problem

Cited in

(2)

• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
• The Capacity-C Torch Problem

This page was built for publication: A combinatorial solution for bridge and torch problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226477)