Decomposition based hybrid metaheuristics (Q319285): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search for a vehicle routing problem with multiple routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition, Lagrangean relaxation and metaheuristic design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Hybrid Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in memetic algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation guided problem space search heuristics for generalized assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Benders decomposition using a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for three-stage two-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multidimensional Knapsack Problem: Structure and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of optimal methods for local access uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Cuts in Benders Decomposition / rank
 
Normal rank

Latest revision as of 15:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Decomposition based hybrid metaheuristics
scientific article

    Statements

    Decomposition based hybrid metaheuristics (English)
    0 references
    0 references
    6 October 2016
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    mixed integer programming
    0 references
    hybrid optimization approaches
    0 references
    decomposition techniques
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers