FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2072866475> ?p ?o ?g. }

• W2072866475 endingPage "156" @default.
• W2072866475 startingPage "139" @default.
• W2072866475 abstract "In this paper, we study the single commodity flow problems, optimizing two objectives simultaneously, where the flow values must be integer values. We propose a method that finds all the efficient integer points in the objective space. Our algorithm performs two phases. In the first phase, all integer points on the efficient boundary are found and in the second phase, the efficient integer points that do not lie on the efficient boundary are calculated. In addition, we carry out a computational experiment showing that the number of efficient integer solutions that do not lie on the efficient boundary is greater than the number of integer solutions on the efficient boundary. In many combinatorial optimization problems, the selection of the optimum solution takes into account more than one criterion. For example, in transportation problems or in network flows problems, the criteria that can be considered are the minimization of the cost for selected routes, the minimization of arrival times at the destinations, the minimization of the deterioration of goods, the minimization of the load capacity that would not be used in the selected vehicles, the maximization of safety, reliability, etc. Often, these criteria are in conflict and for this reason, a multiobjective network flow formulation of the problem is necessary. The solution to this problem is searched for among the set of efficient points. Although multiobjective network flow problems can be solved using the techniques available for the multiobjective linear programming problem, network-based methods are computationally better. The multicriteria minimum cost flow problem has already merited the attention of several authors and the case which has been considered in literature is that which has two objectives, where the continuous flow values are permissible. However, the integer case of the biobjective minimum cost flow problem has scarcely been studied. Whereas, in many real network flow problems, integer values on flow values are required. In this paper, we propose an approach to solve the biobjective integer minimum cost flow problem. An algorithm to obtain all efficient integer solutions of this problem is introduced. This method is characterized by the use of the classic resolution tools of network flow problems, such as the network simplex method. It does not utilize the biobjective integer linear programming methodology. Furthermore, the method does not calculate dominated solutions, so it is not necessary to incorporate tools to eliminate dominated solutions." @default.
• W2072866475 created "2016-06-24" @default.
• W2072866475 creator A5008085496 @default.
• W2072866475 creator A5086529667 @default.
• W2072866475 date "2001-02-01" @default.
• W2072866475 modified "2023-10-11" @default.
• W2072866475 title "An algorithm for the biobjective integer minimum cost flow problem" @default.
• W2072866475 cites W1978090048 @default.
• W2072866475 cites W1989559293 @default.
• W2072866475 cites W2012739502 @default.
• W2072866475 cites W2033982221 @default.
• W2072866475 cites W2056178482 @default.
• W2072866475 cites W2062147306 @default.
• W2072866475 cites W2065305730 @default.
• W2072866475 cites W2081975444 @default.
• W2072866475 cites W2082300779 @default.
• W2072866475 cites W2094079836 @default.
• W2072866475 doi "https://doi.org/10.1016/s0305-0548(99)00095-7" @default.
• W2072866475 hasPublicationYear "2001" @default.
• W2072866475 type Work @default.
• W2072866475 sameAs 2072866475 @default.
• W2072866475 citedByCount "42" @default.
• W2072866475 countsByYear W20728664752012 @default.
• W2072866475 countsByYear W20728664752013 @default.
• W2072866475 countsByYear W20728664752014 @default.
• W2072866475 countsByYear W20728664752016 @default.
• W2072866475 countsByYear W20728664752018 @default.
• W2072866475 countsByYear W20728664752020 @default.
• W2072866475 countsByYear W20728664752021 @default.
• W2072866475 crossrefType "journal-article" @default.
• W2072866475 hasAuthorship W2072866475A5008085496 @default.
• W2072866475 hasAuthorship W2072866475A5086529667 @default.
• W2072866475 hasConcept C11413529 @default.
• W2072866475 hasConcept C114614502 @default.
• W2072866475 hasConcept C114809511 @default.
• W2072866475 hasConcept C126255220 @default.
• W2072866475 hasConcept C134306372 @default.
• W2072866475 hasConcept C147764199 @default.
• W2072866475 hasConcept C157469704 @default.
• W2072866475 hasConcept C170334043 @default.
• W2072866475 hasConcept C199360897 @default.
• W2072866475 hasConcept C2524010 @default.
• W2072866475 hasConcept C2776330181 @default.
• W2072866475 hasConcept C33923547 @default.
• W2072866475 hasConcept C38349280 @default.
• W2072866475 hasConcept C39847760 @default.
• W2072866475 hasConcept C41008148 @default.
• W2072866475 hasConcept C41045048 @default.
• W2072866475 hasConcept C56086750 @default.
• W2072866475 hasConcept C62354387 @default.
• W2072866475 hasConcept C97137487 @default.
• W2072866475 hasConcept C99545648 @default.
• W2072866475 hasConceptScore W2072866475C11413529 @default.
• W2072866475 hasConceptScore W2072866475C114614502 @default.
• W2072866475 hasConceptScore W2072866475C114809511 @default.
• W2072866475 hasConceptScore W2072866475C126255220 @default.
• W2072866475 hasConceptScore W2072866475C134306372 @default.
• W2072866475 hasConceptScore W2072866475C147764199 @default.
• W2072866475 hasConceptScore W2072866475C157469704 @default.
• W2072866475 hasConceptScore W2072866475C170334043 @default.
• W2072866475 hasConceptScore W2072866475C199360897 @default.
• W2072866475 hasConceptScore W2072866475C2524010 @default.
• W2072866475 hasConceptScore W2072866475C2776330181 @default.
• W2072866475 hasConceptScore W2072866475C33923547 @default.
• W2072866475 hasConceptScore W2072866475C38349280 @default.
• W2072866475 hasConceptScore W2072866475C39847760 @default.
• W2072866475 hasConceptScore W2072866475C41008148 @default.
• W2072866475 hasConceptScore W2072866475C41045048 @default.
• W2072866475 hasConceptScore W2072866475C56086750 @default.
• W2072866475 hasConceptScore W2072866475C62354387 @default.
• W2072866475 hasConceptScore W2072866475C97137487 @default.
• W2072866475 hasConceptScore W2072866475C99545648 @default.
• W2072866475 hasIssue "2" @default.
• W2072866475 hasLocation W20728664751 @default.
• W2072866475 hasOpenAccess W2072866475 @default.
• W2072866475 hasPrimaryLocation W20728664751 @default.
• W2072866475 hasRelatedWork W184565551 @default.
• W2072866475 hasRelatedWork W2069541586 @default.
• W2072866475 hasRelatedWork W2590727506 @default.
• W2072866475 hasRelatedWork W3000598246 @default.
• W2072866475 hasRelatedWork W3141113327 @default.
• W2072866475 hasRelatedWork W3159013657 @default.
• W2072866475 hasRelatedWork W4206915070 @default.
• W2072866475 hasRelatedWork W4235062313 @default.
• W2072866475 hasRelatedWork W4311255633 @default.
• W2072866475 hasRelatedWork W4381333972 @default.
• W2072866475 hasVolume "28" @default.
• W2072866475 isParatext "false" @default.
• W2072866475 isRetracted "false" @default.
• W2072866475 magId "2072866475" @default.
• W2072866475 workType "article" @default.