Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453): 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.1287/ijoc.1110.0458 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096788301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A location-routing problem for the conversion to the ``click-and-mortar'' retailing: the static case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity and distance constrained plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources / 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: Multi-stage Benders Decomposition for Optimizing Multicore Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the single source modular capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for solving to optimality uncapacitated location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: New savings based algorithms for time constrained pickup and delivery of full truckloads. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of large scale, single-source, capacitated plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid method for the planning and scheduling / 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: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of genetic algorithms to solve location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the plant-cycle location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and exact solutions for a class of stochastic location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Heuristic Methods for the Location-Routeing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic facility location: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A double annealing algorithm for discrete location/allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration and tabu search: A head to head comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of ignoring routes when locating depots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the uncapacitated facility location problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constraint Programming Approach for Solving a Queueing Design and Control Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase tabu search approach to the location routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank

Latest revision as of 06:39, 12 July 2024

scientific article
Language Label Description Also known as
English
Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
scientific article

    Statements

    Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (English)
    0 references
    29 June 2016
    0 references
    facility location
    0 references
    fleet management
    0 references
    logic-based Benders decomposition
    0 references
    IP/CP hybrid
    0 references
    0 references
    0 references

    Identifiers