On Lagrangian relaxation for constrained maximization and reoptimization problems
From MaRDI portal
Publication:2664005
Recommendations
Cites work
- scientific article; zbMATH DE number 1182757 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 7238962 (Why is no real title available?)
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A bicriteria approach to robust optimization
- A theory and algorithms for combinatorial reoptimization
- A unified approach to approximating partial covering problems
- An efficient approximation for the generalized assignment problem
- An overview of bilevel optimization
- Analysis and experimental study of heuristics for job scheduling reoptimization problems
- Approximating the throughput of multiple machines in real-time scheduling
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Complexity and approximation in reoptimization
- Derandomized graph products
- Multiple and bicriteria scheduling: A literature survey
- New advances in reoptimizing the minimum Steiner tree problem
- Real-time scheduling with a budget
- Reoptimization in machine scheduling
- Reoptimization of NP-Hard Problems
- Reoptimization of maximum weight induced hereditary subgraph problems
- Reoptimization of the shortest common superstring problem
- Resource allocation in bounded degree trees
- The constrained minimum spanning tree problem
- Tight approximation algorithms for maximum separable assignment problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- A lagrangean relaxation algorithm for the constrained matrix problem
- On Lagrangian Relaxation and Subset Selection Problems
- Lagrangian relaxation and partial cover (Extended abstract)
- Principles and Practice of Constraint Programming – CP 2004
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Budgeted matroid maximization: a parameterized viewpoint
This page was built for publication: On Lagrangian relaxation for constrained maximization and reoptimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664005)
