A theory and algorithms for combinatorial reoptimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1617242 (Why is no real title available?)
- scientific article; zbMATH DE number 5859273 (Why is no real title available?)
- scientific article; zbMATH DE number 1305477 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 1445307 (Why is no real title available?)
- scientific article; zbMATH DE number 6472606 (Why is no real title available?)
- A Best Possible Heuristic for the k-Center Problem
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A computational study of cost reoptimization for min-cost flow problems
- A general approach for incremental approximation and hierarchical clustering
- A new algorithm for reoptimizing shortest paths when the arc costs change
- A simple heuristic for the p-centre problem
- A theory and algorithms for combinatorial reoptimization
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Approximation algorithms for NP-hard problems.
- Bounds on Multiprocessing Timing Anomalies
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Centrality of trees for capacitated \(k\)-center
- Complexity and approximation in reoptimization
- Cost-oblivious storage reallocation
- Fast network re-optimization schemes for MPLS and optical networks
- Fundamentals of parameterized complexity
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Minimal cost reconfiguration of data placement in storage area network
- New approaches to multi-objective optimization
- On the Hardness of Reoptimization
- On the parameterized complexity of dynamic problems
- On two class-constrained versions of the multiple knapsack problem
- Reallocation problems in scheduling
- Reoptimization of minimum and maximum traveling salesman's tours
- Reoptimization of the Shortest Common Superstring Problem
- Reoptimization of the minimum total flow-time scheduling problem
- Reoptimizing the 0-1 knapsack problem
- Reoptimizing the traveling salesman problem
- Simple and fast reoptimizations for the Steiner tree problem
- Swapping a failing edge of a single source shortest paths tree is good and fast
- The Euclidean \(k\)-supplier problem
- The Power of Dynamic Distance Oracles
- The constrained minimum spanning tree problem
Cited in
(19)- Progressively strengthening and tuning MIP solvers for reoptimization
- The MIP workshop 2023 computational competition on reoptimization
- A survey on makespan minimization in semi-online environments
- Parameterized Dynamic Cluster Editing
- Analysis and experimental study of heuristics for job scheduling reoptimization problems
- Incremental optimization of independent sets under the reconfiguration framework
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- The noising method: A new method for combinatorial optimization
- The Euclidean \(k\)-supplier problem in \(I R^2\)
- Exact lexicographic scheduling and approximate rescheduling
- On the tradeoff between stability and fit
- scientific article; zbMATH DE number 7561666 (Why is no real title available?)
- scientific article; zbMATH DE number 7238962 (Why is no real title available?)
- A theory and algorithms for combinatorial reoptimization
- A survey on combinatorial optimization in dynamic environments
- Parameterized dynamic cluster editing
- Robust algorithms for total completion time
- Optimal recombination algorithms for generalized chains
- Redistricting optimization with recombination: a local search case study
This page was built for publication: A theory and algorithms for combinatorial reoptimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709582)
