Minimum Ratio Canceling is Oracle Polynomial for Linear Programming, but Not Strongly Polynomial, Even for Networks [PDF]
, 1999 This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with geometric convergence.
S. Thomas McCormick, Akiyoshi Shioura
core
Maximum constraint satisfaction on diamonds [PDF]
In this paper we study the complexity of the (weighted) maximum constr aint satisfaction problem (Max CSP) over an arbitrary finite domain. In this pro blem, one is given a collection of weighted constraints on overlapping sets of v ariables, and the ...
Krokhin, Andrei, Larose, Benoit
core
On strongly polynomial algorithms for some classes of quadratic programming problems [PDF]
, 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 +1 more source
A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk) [PDF]
We give a strongly polynomial algorithm for minimum cost generalized flow, and hence for optimizing any linear program with at most two non-zero entries per row, or at most two non-zero entries per column.
Olver, Neil +4 more
core +1 more source
Comparative Evaluation of Machine Learning and Conventional Material Decomposition Algorithms for Spectral Chest Radiography Using a CdTe Photon-Counting Detector. [PDF]
Sensors (Basel)Marupudi S, Ghammraoui B.
europepmc +1 more source
A case study to compare the methods of SOC estimation for lithium-ion batteries using second-order RC circuit model. [PDF]
Sci RepXu HY, Wang JL, Wang WW.
europepmc +1 more source
Coalition structures induced by the strength of a graph [PDF]
We study cooperative games associated with a communication structure which takes into account a level of communication between players. Let us consider an undirected communication graph : each node represents a player and there is an edge between two ...
Michel Grabisch, Alexandre Skoda
core
Fully Characterizing Lossy Catalytic Computation. [PDF]
AlgorithmicaFolkertsma M +3 more
europepmc +1 more source
Research on Error Compensation Methods of Dynamic Gravity Measurement Based on Swarm Cooperation Evolution Strategy and Optimized LSTM. [PDF]
Entropy (Basel)Li X +5 more
europepmc +1 more source
Extending homomorphic algorithms for encrypted text comparison. [PDF]
Sci RepSeco-Aguirre I +3 more
europepmc +1 more source