Search Results - "68Q25: Analysis of algorithms and problem complexity"

Advances on strictly Δ-modular IPs: Advances on strictly Δ-modular IPs: M. Nägele et al.

Authors: Nägele, Martin Nöbel, Christian Santiago, Richard et al.

Source: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p731-760. 30p.

Subject Terms: *MATHEMATICAL programming, *INTEGER programming, *ALGORITHMS, COMBINATORIAL optimization, CUTTING stock problem

A linear time algorithm for linearizing quadratic and higher-order shortest path problems: A linear time algorithm for linearizing quadratic...: E. Çela et al.

Authors: Çela, Eranda Klinz, Bettina Lendl, Stefan et al.

Source: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p165-188. 24p.

Subject Terms: *ALGORITHMS, QUADRATIC programming, COMBINATORIAL optimization

(Re)packing Equal Disks into Rectangle.

Authors: Fomin, Fedor V. Golovach, Petr A. Inamdar, Tanmay et al.

Source: Discrete & Computational Geometry. Dec2024, Vol. 72 Issue 4, p1596-1629. 34p.

Subject Terms: *COMPUTATIONAL geometry, *NP-hard problems, *COMPUTATIONAL complexity, *PROBLEM solving, *INTEGERS

Small PSL(2,F) representations of Seifert fiber space groups

Authors: Hoffman, Neil R. Petersen, Kathleen L.

Subject Terms: math.GT: Geometric Topology, cs.CC: Computational Complexity, 57M50: General geometric structures on low-dimensional manifolds, 68Q25: Analysis of algorithms and problem complexity

File Description: application/pdf

Relation: http://arxiv.org/abs/2209.05478v1; Hoffman, N.R., Petersen, K.L. (2022). Small PSL(2,F) representations of Seifert fiber space groups.; https://shareok.org/handle/11244/336599; ScopusID: 16642919400 (Hoffman, Neil R)

Availability: https://shareok.org/handle/11244/336599

On the optimality of pseudo-polynomial algorithms for integer programming.

Authors: Fomin, Fedor V. Panolan, Fahad Ramanujan, M. S. et al.

Source: Mathematical Programming. Mar2023, Vol. 198 Issue 1, p561-593. 33p.

Subject Terms: *INTEGER programming, *ALGORITHMS, NONNEGATIVE matrices, COMPUTABLE functions

A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows.

Authors: Graf, Lukas Harks, Tobias

Source: Mathematical Programming. Feb2023, Vol. 197 Issue 2, p761-792. 32p.

Subject Terms: *ALGORITHMS, TRAFFIC assignment, EQUILIBRIUM, GRANULAR flow

On the complexity of cusped non-hyperbolicity

Authors: Haraway, Robert, III Hoffman, Neil R.

Subject Terms: math.GT: Geometric Topology, 68Q25: Analysis of algorithms and problem complexity, 57M50: General geometric structures on low-dimensional manifolds

File Description: application/pdf

Relation: http://arxiv.org/abs/1907.01675v3; https://shareok.org/handle/11244/336603; ScopusID: 16642919400 (Hoffman, Neil R)

Availability: https://shareok.org/handle/11244/336603

Approximability of average completion time scheduling on unrelated machines.

Authors: Sitters, René

Source: Mathematical Programming. Jan2017, Vol. 161 Issue 1/2, p135-158. 24p.

Subject Terms: *SCHEDULING, *APPROXIMATION algorithms, *MIXED integer linear programming, *QUADRATIC programming, *MACHINE performance

An efficient polynomial time approximation scheme for load balancing on uniformly related machines.

Authors: Epstein, Leah Levin, Asaf

Source: Mathematical Programming. Oct2014, Vol. 147 Issue 1/2, p1-23. 23p.

Subject Terms: *LOAD balancing (Computer networks), *POLYNOMIAL time algorithms, *APPROXIMATION theory, *DYNAMIC programming, *COMPUTER scheduling

An Axiomatic Approach to Time-Dependent Shortest Path Oracles.

Authors: Kontogiannis, Spyros Wagner, Dorothea Zaroliagis, Christos

Source: Algorithmica. Mar2022, Vol. 84 Issue 3, p815-870. 56p.

Subject Terms: *APPROXIMATION error, *HIGHWAY planning, *GRAPH algorithms

Coordination of a two-level supply chain with contracts.

Authors: Phouratsamay, Siao-Leu Kedad-Sidhoum, Safia Pascual, Fanny

Source: 4OR (1619-4500); Jun2021, Vol. 19 Issue 2, p235-264, 30p

Linear programming using limited-precision oracles.

Authors: Gleixner, Ambros Steffy, Daniel E.

Source: Mathematical Programming. Sep2020, Vol. 183 Issue 1/2, p525-554. 30p.

Subject Terms: *ALGORITHMS, *ARITHMETIC, *DIOPHANTINE approximation, *MODULAR arithmetic, *SYMBOLIC computation

Domain Complexity in Corrective Maintenance Tasks' Complexity: An Empirical Study in a Micro Software Company.

Authors: Stojanov, Zeljko Stojanov, Jelena Dobrilovic, Dalibor

Source: Theory & Applications of Mathematics & Computer Science; 2018, Vol. 8 Issue 1, p24-38, 15p

Subject Terms: COMPUTATIONAL complexity, REPAIRING, COMPUTER software industry, MATHEMATICAL models, APPLICATION software

Graph Isomorphism, Color Refinement, and Compactness.

Authors: Arvind, V. Köbler, Johannes Rattan, Gaurav et al.

Source: Computational Complexity; Sep2017, Vol. 26 Issue 3, p627-685, 59p

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.

Authors: Dantchev, Stefan Martin, Barnaby

Source: Computational Complexity; Mar2013, Vol. 22 Issue 1, p191-213, 23p

Subject Terms: BINARY principle (Linguistics), REFUTATION (Logic), FINITE model theory, MODEL theory, INFINITE element method

Buy-at-Bulk Network Design with Protection.

Authors: Antonakopoulos, Spyridon Chekuri, Chandra Shepherd, Bruce et al.

Source: Mathematics of Operations Research; Feb2011, Vol. 36 Issue 1, p71-87, 17p, 3 Diagrams

Subject Terms: ALGORITHMS, TELECOMMUNICATION systems, OPTICAL communications, APPROXIMATION theory, FIBER optics industry

Incremental Construction Algorithms For Lattices Generated By Many Lattice Points

Authors: Boris Hemkemeier Frank Vallentin The Pennsylvania State University CiteSeerX Archives

Contributors: Boris Hemkemeier Frank Vallentin The Pennsylvania State University CiteSeerX Archives

Source: http://www-lsii.mathematik.uni-dortmund.de/~fv/odsa/odsa_bhfv_paper.ps.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.8466

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.8466
http://www-lsii.mathematik.uni-dortmund.de/~fv/odsa/odsa_bhfv_paper.ps