On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2020.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3110535523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource allocation in bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted matching and budgeted matroid intersection via the gasoline puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Advances in Reoptimizing the Minimum Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization in machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of maximum weight induced hereditary subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Approximation Algorithms for Maximum Separable Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of Weighted Independent Set and Hereditary Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple and bicriteria scheduling: A literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time scheduling with a budget / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory and algorithms for combinatorial reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of NP-Hard Problems / rank
 
Normal rank

Latest revision as of 01:15, 25 July 2024

scientific article
Language Label Description Also known as
English
On Lagrangian relaxation for constrained maximization and reoptimization problems
scientific article

    Statements

    On Lagrangian relaxation for constrained maximization and reoptimization problems (English)
    0 references
    0 references
    0 references
    0 references
    20 April 2021
    0 references
    0 references
    Lagrangian relaxation
    0 references
    constrained maximization
    0 references
    subset selection
    0 references
    set maximization problems
    0 references
    combinatorial reoptimization
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references