A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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.cor.2023.106313 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4380894174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LocalSolver 1.x: A black-box local-search solver for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic for a customer assignment problem in direct marketing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the non-linear generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quality and distance guided hybrid algorithm for the vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a fix-and-relax framework for a class of project scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Multi-Resource Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: DGAP -- The dynamic generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online generalized assignment problem with historical information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics. Algorithms and implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path-relinking for the generalized quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-resource generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Assignment Problem and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new extended formulation of the generalized assignment problem and some associated valid inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the Generalized Assignment Problem and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment problem with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method with variable fixing for solving the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition based hybrid metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal Heuristics for Branch and Price: The Assets of Diving Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach with ejection chains for the generalized assignment problem / rank
 
Normal rank

Latest revision as of 20:32, 2 August 2024

scientific article; zbMATH DE number 7737001
Language Label Description Also known as
English
A three-phase matheuristic algorithm for the multi-day task assignment problem
scientific article; zbMATH DE number 7737001

    Statements

    A three-phase matheuristic algorithm for the multi-day task assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2023
    0 references
    heuristics
    0 references
    integer programming
    0 references
    matheuristics
    0 references
    task assignment
    0 references
    generalized assignment
    0 references
    0 references
    0 references

    Identifiers