Search Results

A branch-&-price approach to the unrooted maximum agreement forest problem

• Authors : Frohn, Martin; Kelk, Steven; Vychytilova, Simona

Subjects: Branch-&-price; Dynamic programming; Phylogenetics

• Source: Frohn, M, Kelk, S & Vychytilova, S 2025, 'A branch- &-price approach to the unrooted maximum agreement forest problem', Operations Research Letters, vol. 63, 107364.

Record details

Optimizing Periodic Operations for Efficient Inland Waterway Lock Management

• Authors : Golak, Julian; Grigoriev, Alexander; van Lent, Freija

Subjects: algorithms; logistics; scheduling

• Source: Golak, J, Grigoriev, A, van Lent, F & van der Zanden, T 2025 'Optimizing Periodic Operations for Efficient Inland Waterway Lock Management' arXiv.org, no. 2506.17743, Cornell University - arXiv.

Record details

Minimizing total completion time with machine-dependent priority lists

• Authors : Ravindran Vijayalakshmi, Vipin; Schröder, Marc; Tamir, Tami

Subjects: Total completion time; priorities; dynamic programming

• Source: Ravindran Vijayalakshmi, V, Schröder, M & Tamir, T 2024, 'Minimizing total completion time with machine-dependent priority lists', European Journal of Operational Research, vol. 315, no. 3, pp.

Record details

A PTAS for Minimizing Weighted Flow Time on a Single Machine

• Authors : Armbruster, Alexander; Rohwedder, Lars; Wiese, Andreas ...

Subjects: dynamic programming; flow time; PTAS

• Source: Armbruster, A, Rohwedder, L & Wiese, A 2023, A PTAS for Minimizing Weighted Flow Time on a Single Machine. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on

Record details

A dynamic programming algorithm for the ATM network installation problem on a tree

• Authors : van de Leensel, R.L.J.M.; Flippo, O.E.; Koster, Arie M.C.A.

• Source: van de Leensel, R L J M, Flippo, O E & Koster, A M C A 1998 'A dynamic programming algorithm for the ATM network installation problem on a

Record details

Vessel velocity decisions in inland waterway transportation under uncertainty

• Authors : Buchem, Moritz; Golak, Julian Arthur Pawel; Grigoriev, Alexander

Subjects: atira/keywords/jel_classifications/c00; name=c00 - Mathematical and Quantitative Methods: General; climate change

• Source: Buchem, M, Golak, J A P & Grigoriev, A 2022, 'Vessel velocity decisions in inland waterway transportation under uncertainty', European Journal of Operational Research, vol. 296, no. 2, pp. 669-678.

Record details

A time- And space-optimal algorithm for the many-visits TSP

• Authors : Berger, André; Kozma, László; Mnich, Matthias

Subjects: TRAVELING SALESMAN PROBLEM; DYNAMIC-PROGRAMMING APPROACH; FIXED NUMBER

• Source: Berger, A, Kozma, L, Mnich, M & Vincze, R 2019, A time- And space-optimal algorithm for the many-visits TSP. in Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for

Record details

Polynomial time algorithms for some multi-level lot-sizing problems with production capacities

• Authors : van Hoesel, C.P.M.; Romeijn, H.E.; Romero Morales, M.D.

Subjects: atira/keywords/jel_classifications/c61;

• Source: van Hoesel, C P M, Romeijn, H E, Romero Morales, M D & Wagelmans, A 2002 'Polynomial time algorithms for some multi-level lot-sizing problems with production capacities' METEOR Research Memorandum,

Record details

A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs

• Authors : Grigoriev, Alexander; Kobayashi, Yasuaki; Tamaki, Hisao ...

Subjects: planar graphs; polynomial delay generation; potential maximal cliques

• Source: Grigoriev, A, Kobayashi, Y, Tamaki, H & van der Zanden, T C 2025, A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs. in A Agrawal & E J V Leeuwen

Record details

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs

• Authors : Grigoriev, Alexander; Kobayashi, Yasuaki; Tamaki, Hisao

Subjects: potential maximal cliques; treewidth; planar graphs

• Source: Grigoriev, A, Kobayashi, Y, Tamaki, H & van der Zanden, T C 2025 'A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs' arXiv.org, no. 2506.12635,

Record details