[PDF] Top 20 Playing with the Maximum-Flow Problem

... traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing ...The problem ... See full document

... the maximum flow over time problem, and described an efficient algo- rithm to solve ...This problem consists of a given time window in which as much flow as possible is to be sent from ... See full document

... interdiction problem is a classical problem in the network ...this problem is as follows: In the network optimization problems, for example, the maximum flow network, the shortest path, ... See full document

... The maximum flow problem is one of the combinatorial optimization ...the problem is to find maximum amount of flow from the source to the sink in a ...the problem using ... See full document

... no-wait flow shop have been presented by Artanary in 1971 and 1974 ...scheduling problem extensively and published their research ...no-wait flow shop ...scheduling problem was presented by ... See full document

... According to Framinan et al. (2004), in this phase the jobs are sequenced according to a certain property based on the data of the problem. In this paper, the phase I heuristic models are: MM proposed by Ronconi ... See full document

... delay. Maximum flow-time is also a very natural generalization of the minimum makespan or the load-balancing problem, that has been studied extensively (see, ...the maximum flow-time ... See full document

... machine) flow shop problem with make span criterion that can be defined as completion time at which all jobs complete processing or equivalently as maximum completion time of jobs ...permutation ... See full document

... unsplittable flow remains ...the maximum edge-disjoint paths (MEDP) problem (this was subsequently extended to the regime where edge congestion is allowed ...unsplittable flow suffers ... See full document

... optimization problem has been extensively explored by ...the flow is governed by transition equation. The flow depends on the difference in ...The problem at hand is depicted a set of ... See full document

... transportation problem is much more natural to originate them in terms of nodes and arcs, taking advantage of the special structure of the ...a maximum network flow technique is that seek to maximize ... See full document

... computing maximum flows in networks are important not only because they are applied directly to the analysis of traffic or communication net- works, but also because they are often employed as sub- problems in ... See full document

... the problem and some polynomial time algorithms were developed on planner graphs for ...Hard problem. Once MFNIP was proved as NP Hard problem, efforts were made to develop approximation algorithms ... See full document

... constrained flow problems where the bounds are parametric with fixed number of ...network flow problems are more general and difficult than the previously studied network flow problems and fixed ... See full document

... the problem, which provides the order in which the customers (cities) should be visited and does not require additional processes of feasibility or ...path problem (SPP) using an auxiliary graph constructed ... See full document

... The frequentist inference determines the winning probability using single conditional probability. Bayesian inference estimates the winning probability using expected values that are weighted averages of individual ... See full document

... The single tests as well as the maximum tests are performed as permutation tests, i.e. the inference is based on the permutation null distribution of the test statistic (see e.g. Berry et al., 2016). Thus, the ... See full document

... Routing design problems are of a major importance in- computer communications and combinatorial optimiza- tion. The traveling salesman problem (TSP) and related Hamilton path problem play important role in ... See full document

... 4. Analytical fragility functions based on structural mod- eling and response simulations (e.g., Macabuag et al., 2014; Nanayakkara and Dias, 2016; Attary et al., 2017). Recent studies have shown tsunami hydrodynamic ... See full document

... Influenced by participatory design and probe approaches to technology design, we built and tested mock infrastructures of RFID-based identification systems including low fidelity pa[r] ... See full document