Results 51 to 60 of about 75 (75)
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]
Math ProgramÇela E +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Linear Programming and Community Detection
Mathematics of Operations Research, 2023Alberto Del Pia +2 more
exaly
Reduction of Potential-Based Flow Networks
Mathematics of Operations Research, 2023Marc Pfetsch, Max Klimm, Martin Skutella
exaly
Feasible Bases for a Polytope Related to the Hamilton Cycle Problem
Mathematics of Operations Research, 2021Thomas Kalinowski, Sogol Mohammadian
exaly
Target K-Coverage Problem in Wireless Sensor Networks
Journal of Discrete Mathematical Sciences and Cryptography, 2020Sandeep Kumar
exaly