A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923): 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.disopt.2019.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2947392384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of set partitioning with application to scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ILP models and column generation for the minimum sum coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staff scheduling and rostering: a review of applications, methods and models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey, categorization, and comparison of recent tour scheduling literature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crew pairing at Air France / rank
 
Normal rank
Property / cites work
 
Property / cites work: The train driver recovery problem-a set partitioning based model and solution method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation approaches to ship scheduling with flexible cargo sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for the cutting stock problem with different qualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set packing model for the ground holding problem in congested networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Railway track allocation: Models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set covering based matheuristic for a real‐world city logistics problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set-covering based heuristic algorithm for the periodic vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primer in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some difficult linear programs coming from set partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent procedure for the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution framework for a broad class of vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Period Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Column Generation and Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Mixed Integer Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 03:03, 21 July 2024

scientific article
Language Label Description Also known as
English
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
scientific article

    Statements

    A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 November 2019
    0 references
    dual ascent heuristic
    0 references
    Lagrangian relaxation
    0 references
    subgradient method
    0 references
    generalized set partitioning
    0 references
    0 references

    Identifiers