A theory and algorithms for combinatorial reoptimization
From MaRDI portal
Publication:1709582
DOI10.1007/s00453-017-0274-8zbMath1396.90076OpenAlexW2582119617MaRDI QIDQ1709582
Baruch Schieber, Tami Tamir, Hadas Shachnai, Gal Tamir
Publication date: 6 April 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2874
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (11)
A survey on makespan minimization in semi-online environments ⋮ The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems ⋮ Parameterized dynamic cluster editing ⋮ Robust algorithms for total completion time ⋮ Unnamed Item ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ Unnamed Item ⋮ Parameterized Dynamic Cluster Editing
Uses Software
Cites Work
- Fundamentals of parameterized complexity
- New approaches to multi-objective optimization
- Reoptimizing the 0-1 knapsack problem
- Reallocation problems in scheduling
- A simple heuristic for the p-centre problem
- On the parameterized complexity of dynamic problems
- Reoptimization of minimum and maximum traveling salesman's tours
- A new algorithm for reoptimizing shortest paths when the arc costs change
- Swapping a failing edge of a single source shortest paths tree is good and fast
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Fast network re-optimization schemes for MPLS and optical networks
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
- A Theory and Algorithms for Combinatorial Reoptimization
- The Power of Dynamic Distance Oracles
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Minimal Cost Reconfiguration of Data Placement in Storage Area Network
- Reoptimization of the Shortest Common Superstring Problem
- A Best Possible Heuristic for the k-Center Problem
- Reoptimizing the traveling salesman problem
- The Euclidean k-Supplier Problem
- Reoptimization of the Minimum Total Flow-Time Scheduling Problem
- Cost-Oblivious Storage Reallocation
- The constrained minimum spanning tree problem
- A General Approach for Incremental Approximation and Hierarchical Clustering
- Centrality of Trees for Capacitated k-Center
- On the Hardness of Reoptimization
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Bounds on Multiprocessing Timing Anomalies
- On two class-constrained versions of the multiple knapsack problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A theory and algorithms for combinatorial reoptimization
