Related papers: A Combinatorial Algorithm for the Multi-commodity …
The cross-dock door design problem consists of deciding the strip and stack doors and nominal capacity of an entity under uncertainty. Inbound commodity flow from origin nodes is assigned to the strip doors, it is consolidated in the…
We show that the pseudoflow algorithm for maximum flow is particularly efficient for the bipartite matching problem both in theory and in practice. We develop several implementations of the pseudoflow algorithm for bipartite matching, and…
A new algorithm has been developed to compute low Mach Numbers supercritical fluid flows. The algorithm is applied using a finite volume method based on the SIMPLER algorithm. Its main advantages are to decrease significantly the CPU time,…
In this paper, we propose a multi-player extension of the minimum cost flow problem inspired by a transportation problem that arises in modern transportation industry. We associate one player with each arc of a directed network, each trying…
We introduce a new class of combinatorial markets in which agents have covering constraints over resources required and are interested in delay minimization. Our market model is applicable to several settings including scheduling, cloud…
We present an $m^{4/3+o(1)}\log W$-time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where $W$ is the maximum absolute value of any edge weight. For sparse graphs, this improves over the best known…
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…
We study the minimum-concave-cost flow problem on a two-dimensional grid. We characterize the computational complexity of this problem based on the number of rows and columns of the grid, the number of different capacities over all arcs,…
Column generation is often used to solve multi-commodity flow problems. A program for column generation always includes a module that solves a linear equation. In this paper, we address three major issues in solving linear problem during…
To contrast different generators for flow equations for Hamiltonians and to discuss the dependence of physical quantities on unitarily equivalent, but effectively different initial Hamiltonians, a numerically solvable model is considered…
We give two results for multicommodity flows in the $d$-dimensional hypercube ${Q}^d$ with independent random edge capacities distributed like $C$ where $\Pr[C>0]>1/2$. Firstly, with high probability as $d \rightarrow \infty$, the network…
The minimum cost-flow problems have been attracted recently in optimization because of their applications in several areas of applied science and real life. Therefore, finding optima solution of these problems would be significant. Although…
Bifurcation phenomena in nonlinear dynamical systems often lead to multiple coexisting stable solutions, particularly in the presence of symmetry breaking. Deterministic machine learning models are unable to capture this multiplicity,…
The advent of new special-purpose hardware such as FPGA or ASIC-based annealers and quantum processors has shown potential in solving certain families of complex combinatorial optimization problems more efficiently than conventional CPUs.…
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…
This paper considers the problem of energy-efficient transmission in multi-flow multihop cooperative wireless networks. Although the performance gains of cooperative approaches are well known, the combinatorial nature of these schemes makes…
Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints are only…
We introduce capital flow constraints, loss of good will and loan to the lot sizing problem. Capital flow constraint is different from traditional capacity constraints: when a manufacturer launches production, its present capital should not…
In this paper we address a topological approach to multiflow (multicommodity flow) problems in directed networks. Given a terminal weight $\mu$, we define a metrized polyhedral complex, called the directed tight span $T_{\mu}$, and prove…
Feasibility pumps are highly effective primal heuristics for mixed-integer linear and nonlinear optimization. However, despite their success in practice there are only few works considering their theoretical properties. We show that…