Výsledky vyhľadávania - "Jannik Matuschke"

Single-machine scheduling with setup time: a case study in the cutting of large-scale structural parts.

Autori: Zheng, Peng Guo, Peng Wang, Yakun a ďalší

Zdroj: Engineering Optimization; Oct2025, Vol. 57 Issue 10, p2675-2700, 26p

Multi-Leader Congestion Games with an Adversary.

Autori: HARKS, TOBIAS HENLE, MONA KLIMM, MAX a ďalší

Zdroj: Journal of Artificial Intelligence Research; 2025, Vol. 83, p1-34, 34p

Predmety: STRATEGY games, NASH equilibrium, MATROIDS, EQUILIBRIUM

Assigning and Scheduling Generalized Malleable Jobs Under Subadditive or Submodular Processing Speeds.

Autori: Fotakis, Dimitris Matuschke, Jannik Papadigenopoulos, Orestis

Zdroj: Operations Research; May/Jun2025, Vol. 73 Issue 3, p1598-1614, 17p

Predmety: SCHEDULING, APPROXIMATION algorithms, CONCAVE functions, ALGORITHMS, MACHINERY, EMPIRICAL research, PARALLEL processing

Popular Arborescences and Their Matroid Generalization.

Autori: Kavitha, Telikepalli Makino, Kazuhisa Schlotter, Ildikó a ďalší

Zdroj: ACM Transactions on Algorithms; Apr2025, Vol. 21 Issue 2, p1-35, 35p

Predmety: POLYNOMIAL time algorithms, LINEAR programming, INDEPENDENT sets, MATROIDS, GENERALIZATION, POPULARITY

Decomposition of probability marginals for security games in max-flow/min-cut systems: Decomposition of probability marginals in max-flow/min-cut systems: J. Matuschke.

Autori: Matuschke, Jannik

Zdroj: Mathematical Programming; Mar2025, Vol. 210 Issue 1, p611-640, 30p

Predmety: DIRECTED acyclic graphs, DISTRIBUTION (Probability theory), RANDOM sets, CONSERVATION laws (Physics), OPEN-ended questions

Streaming Algorithms for Geometric Steiner Forest.

Autori: Czumaj, Artur Jiang, Shaofeng H.-C. Krauthgamer, Robert a ďalší

Zdroj: ACM Transactions on Algorithms; Oct2024, Vol. 20 Issue 4, p1-38, 38p

Predmety: COST estimates, OPEN-ended questions, GENERALIZATION, ALGORITHMS, MEMORY

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds.

Autori: Fotakis, Dimitris Matuschke, Jannik Papadigenopoulos, Orestis

Zdroj: Mathematical Programming; Jul2024, Vol. 206 Issue 1/2, p515-539, 25p

Predmety: APPROXIMATION algorithms, SCHEDULING, UTILITY functions, CONCAVE functions, PRODUCTION scheduling

Smart multi-commodity location-routing model for perishable goods with an emphasis on big data under uncertainty and congestion.

Autori: Falari, Sina Rashvand Hafshjani, Kiamars Fathi Afshar Kazemi, Mohammad Ali

Zdroj: Interdisciplinary Journal of Management Studies; Apr2024, Vol. 17 Issue 2, p653-668, 16p

Predmety: PERISHABLE goods, BIG data, SUPPLY chain management, METAHEURISTIC algorithms, QUEUING theory

The Orienteering Problem with Drones.

Autori: Morandi, Nicola Leus, Roel Yaman, Hande

Zdroj: Transportation Science; Jan/Feb2024, Vol. 58 Issue 1, p240-256, 17p

Predmety: ORIENTEERING, ORIENTEERS, LINEAR programming, ENERGY industries, UNITS of time

Malleable scheduling beyond identical machines.

Autori: Fotakis, Dimitris Matuschke, Jannik Papadigenopoulos, Orestis

Zdroj: Journal of Scheduling; Oct2023, Vol. 26 Issue 5, p425-442, 18p

Predmety: GOLDEN ratio, APPROXIMATION algorithms, MACHINERY, SCHEDULING, PRODUCTION scheduling

Formation and Routing of Worker Teams for Airport Ground Handling Operations: A Branch-and-Price-and-Check Approach.

Autori: Dall'Olio, Giacomo Kolisch, Rainer

Zdroj: Transportation Science; Sep/Oct2023, Vol. 57 Issue 5, p1231-1251, 21p

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs.

Autori: Morandi, Nicola Leus, Roel Matuschke, Jannik a ďalší

Zdroj: Transportation Science; Sep/Oct2023, Vol. 57 Issue 5, p1340-1358, 19p

Robust Algorithms for TSP and Steiner Tree.

Autori: GANESH, ARUN MAGGS, BRUCE M. PANIGRAHI, DEBMALYA

Zdroj: ACM Transactions on Algorithms; Apr2023, Vol. 19 Issue 2, p1-37, 37p

Predmety: SPANNING trees, ROBUST optimization, ALGORITHMS, OPERATIONS research

Matroid bases with cardinality constraints on the intersection.

Autori: Lendl, Stefan Peis, Britta Timmermans, Veerle

Zdroj: Mathematical Programming; Jul2022, Vol. 194 Issue 1/2, p661-684, 24p

Predmety: MATROIDS, POLYNOMIAL time algorithms, COST functions, COMBINATORIAL optimization

Approximation and Online Algorithms

Autori: Jannik Matuschke José Verschae

Typ zdroja: eBook.

Predmet: Approximation algorithms--Congresses, Online algorithms--Congresses

Kategórie: MATHEMATICS / Numerical Analysis

Popular branchings and their dual certificates.

Autori: Kavitha, Telikepalli Király, Tamás Matuschke, Jannik a ďalší

Zdroj: Mathematical Programming; Mar2022, Vol. 192 Issue 1/2, p567-595, 29p

Predmety: VOTING, ELECTIONS

Exact and Approximation Algorithms for the Expanding Search Problem.

Autori: Hermans, Ben Leus, Roel Matuschke, Jannik

Zdroj: INFORMS Journal on Computing; Winter2022, Vol. 34 Issue 1, p281-296, 16p

Predmety: SEARCH algorithms, GREEDY algorithms, DISTRIBUTION (Probability theory), DISASTER relief, COAL mining, APPROXIMATION algorithms, ALGORITHMS

FrontMatter.

Zdroj: Lecture Notes in Computer Science; 2017, pI-XIII, 13p

REROUTING FLOWS WHEN LINKS FAIL.

Autori: MATUSCHKE, JANNIK MCCORMICK, S. THOMAS ORIOLO, GIANPAOLO

Zdroj: SIAM Journal on Discrete Mathematics; 2020, Vol. 34 Issue 4, p2082-2107, 26p

Predmety: LINEAR programming, ROBUST optimization, HYPERLINKS, APPROXIMATION algorithms

New and Simple Algorithms for Stable Flow Problems.

Autori: Cseh, Ágnes Matuschke, Jannik

Zdroj: Algorithmica; Jun2019, Vol. 81 Issue 6, p2557-2591, 35p

Predmety: ASSIGNMENT problems (Programming), MATCHING theory, ALGORITHMS, POLYNOMIAL time algorithms, FORCED marriage, MATHEMATICAL equivalence