Results 71 to 80 of about 10,477 (184)
Geometric Rescaling Algorithms for Submodular Function Minimization [PDF]
, 2018 We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain strongly polynomial SFM algorithms.
Daniel Dadush +8 more
core +1 more source
Developments in linear and integer programming
, 2002 In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems ...
Darby-Dowman, K, Wilson, J M
core +1 more source
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core
A strongly polynomial algorithm for the uniform balanced network flow problem
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Polynomial-time algorithms for energy games with special weight structures
, 2014 Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P.
Chatterjee, Krishnendu ; https://orcid.org/ +3 more
core +1 more source
An approximation algorithm for a generalized assignment problem with small resource requirements. [PDF]
We investigate a generalized assignment problem where the resource requirements are either 1 or 2. This problem is motivated by a question that arises when data blocks are to be retrieved from parallel disks as efficiently as possible.
Aerts, J, Korst, J, Spieksma, Frederik
core
Polynomial-Time Algorithms for Energy Games with Special Weight Structures
, 2012 Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P.
Krishnendu Chatterjee +7 more
core +1 more source
On strongly polynomial algorithms for some classes of quadratic programming problems
, 1997 In this paper we survey some results concerning polynomial and/or strongly polynomial solvability of some classes of quadratic programming problems. The discussion on polynomial solvability of continuous convex quadratic programming is followed by a ...
J. Skorin-Kapov, Skorin-Kapov, J.
core
Ciencia del Suelo, 2011 La eficientización de la fertilización en los sistemas pratenses, son una necesidad para los ganaderos del sur de Chile, por su importancia en la alimentación del ganado.
Paulina Alejandra Salazar Espinoza +2 more
doaj
A strongly polynomial time algorithm for a constrained submodular optimization problem
Discrete Applied Mathematics, 2001 The author [Math. Oper. Res. 23, No. 3, 661--679 (1998; Zbl 0977.90073)] presented a weakly polynomial time algorithm for the problem of optimizing over the intersection of a submodular base polyhedron and an affine space (when the number of constraints describing the affine space is bounded).
openaire +2 more sources