An exact algorithm for the modular hub location problem with single assignments (Q1652348): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q940847
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Iván A. Contreras / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2602497572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized subgradient method with relaxation step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part I—Introduction and Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Location as the Minimization of a Supermodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds from a path based formulation for the tree of hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-product capacitated single-allocation hub location problems: formulations and inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation. (With comments and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting polyhedral properties from facility to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and search procedures for a hub location problem with economies of scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting the flow variables for hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem in a star–star network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for hub location problems with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network cost minimization using threshold-based discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub median problem with modular arc capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem with modular link capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic / rank
 
Normal rank

Latest revision as of 02:11, 16 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the modular hub location problem with single assignments
scientific article

    Statements

    An exact algorithm for the modular hub location problem with single assignments (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    hub location
    0 references
    flow-dependent costs
    0 references
    Lagrangean relaxation
    0 references
    0 references
    0 references

    Identifiers