A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition

DOI10.1007/s12597-013-0143-4zbMath1397.90386OpenAlexW2010708412MaRDI QIDQ1788588

Shruti Garg, Anuj Gupta, Sidhant Sharma, Sushen Singh Jamwal, Anil Kumar Agrawal, Satya Prakash, Smriti Jain

Publication date: 8 October 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-013-0143-4

zbMATH Keywords

multigraphoptimizationmultiobjective programmingnondominated solutionbicriterion problemKönigsberg bridge problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized

Cites Work

• A bicriterion call center problem through an evolved branch and bound algorithm
• Optimizing dead mileage in urban bus routes through a nondominated solution approach
• Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search
• Pareto optimal solutions of a cost-time trade-off bulk transportation problem
• The bridges of Königsberg—A historical perspective
• A contemporary Eulerian walk over the bridges of Kaliningrad
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition