Zobrazeno 1 - 10
of 485
pro vyhledávání: '"Nemhauser, George"'
Publikováno v:
In Computers and Operations Research August 2024 168
In \cite{siebert2019linear} the authors present a set of integer programs (IPs) for the Steiner tree problem, which can be used for both, the directed and the undirected setting of the problem. Each IP finds an optimal Steiner tree with a specific st
Externí odkaz:
http://arxiv.org/abs/2002.03055
We present a set of integer programs (IPs) for the Steiner tree problem with the property that the best solution obtained by solving all, provides an optimal Steiner tree. Each IP is polynomial in the size of the underlying graph and our main result
Externí odkaz:
http://arxiv.org/abs/1812.02237
Publikováno v:
In Computers and Operations Research November 2021 135
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, and the loca
Externí odkaz:
http://arxiv.org/abs/1602.08515
Autor:
Bodic, Pierre Le, Nemhauser, George L.
The selection of branching variables is a key component of branch-and-bound algorithms for solving Mixed-Integer Programming (MIP) problems since the quality of the selection procedure is likely to have a significant effect on the size of the enumera
Externí odkaz:
http://arxiv.org/abs/1511.01818
Publikováno v:
In Discrete Optimization November 2020 38
Autor:
Munguía, Lluís-Miquel, Ahmed, Shabbir, Bader, David A., Nemhauser, George L., Shao, Yufen, Papageorgiou, Dimitri J.
Publikováno v:
In Computers and Operations Research November 2019 111:21-34