Suchergebnisse - "(fractional) subadditivity"

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

Autoren: Dimitris Fotakis Jannik Matuschke Orestis Papadigenopoulos

Quelle: Operations Research. 73:1598-1614

Schlagwörter: FOS: Computer and information sciences, Technology, QUAY CRANE ALLOCATION, Operations Research, Discrete Mathematics (cs.DM), makespan minimization, ASSIGNMENT, 0211 other engineering and technologies, Social Sciences, BERTH, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Business & Economics, 0102 Applied Mathematics, (fractional) subadditivity, MACHINES, approximation algorithms, 0802 Computation Theory and Mathematics, Science & Technology, Operations Research & Management Science, WORKERS, malleable scheduling, Management, submodularity, APPROXIMATION ALGORITHMS, 1503 Business and Management, 3507 Strategy, management and organisational behaviour, matroids, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/abs/2111.06225

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows: Fractionally subadditive maximization under an incremental knapsack constraint with applications to incremental flows

Autoren: Yann Disser Max Klimm Annette Lutz et al.

Quelle: SIAM Journal on Discrete Mathematics. 38:764-789

Schlagwörter: flow, fractional subadditivity, Online algorithms, streaming algorithms, Analysis of algorithms, competitive analysis, Robustness in mathematical programming, incremental optimization

Dateibeschreibung: application/xml