Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimized Crossover for the Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy genetic algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid metaheuristics. Third international workshop, HM 2006, Gran Canaria, Spain, October 13--15, 2006. Proceedings / 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: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / 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: Hybrid metaheuristics. Second international workshop, HM 2005, Barcelona, Spain, August 29--30, 2005. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Hybrid metaheuristics. Selected papers based on the presentations at the 1st international workshop (HM 2004), Valencia, Spain, August 2004. / 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: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding branch and bound within evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667436 / 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: Q4418381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem / 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: About Lagrangian methods in integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric tabu-search for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search and local branching / 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: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid search combining interior point methods and metaheuristics for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bringing order into the neighborhoods: Relaxation guided variable neighborhood search / 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: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core concept for the Multidimensional Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory programming: a unified view of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on the 0--1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495207 / rank
 
Normal rank

Latest revision as of 21:46, 10 July 2024

scientific article
Language Label Description Also known as
English
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
scientific article

    Statements

    Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (English)
    0 references
    0 references
    0 references
    9 October 2015
    0 references
    tabu search
    0 references
    column generation
    0 references
    memetic algorithm
    0 references
    Lagrangian relaxation
    0 references
    variable neighborhood search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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