SciTePress - Affiliation Profile

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Affiliation

Department of Industrial Engineering, Birjand University of Technology, Industry and Mining Boulevard, Ibn Hesam Square, Birjand, Iran

Context (please use complete words only)

Field

Sort by

1 Papers

Generalized Maximum Capacity Path Problem with Loss Factors

Topic: Network Optimization

Authors: Javad Tayyebi ¹ , Mihai-Lucian Rîtan ² and Adrian Deaconu ²

Affiliations: ¹ Department of Industrial Engineering, Birjand University of Technology, Industry and Mining Boulevard, Ibn Hesam Square, Birjand, Iran , ² Department of Mathematics and Computer Science, Transilvania University of Brașov, Iuliu Maniu st. 50, Brașov, Romania

Digital Object Identifier: 10.5220/0012387900003639

Proceedings of ICORES 2024, ISBN: 978-989-758-681-1

Quick Abstract

The focus of this paper is on an extension of the maximum capacity path problem, known as the generalized maximum capacity path problem. In the traditional maximum capacity path problem, the objective is to find a path from a source to a sink with the highest capacity among all possible paths. However, this extended problem takes into account the presence of loss factors in addition to arc capacities. The generalized maximum capacity path problem is regarded as a network flow optimization problem, where the network comprises arcs with both capacity constraints and loss factors. The main goal is to identify a path from the source to the sink that allows for the maximum flow along the path, considering the loss factors while satisfying the capacity constraints. The paper introduces a zero-one formulation for the generalized maximum capacity path problem. Additionally, it presents two efficient polynomial-time algorithms that can effectively solve this problem.