Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Paramils / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3007190076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Production Routing Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-vehicle prize collecting arc routing for connectivity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search and simulated annealing algorithms for the inventory routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing hyper-heuristic methodology for flexible decision support / rank
 
Normal rank
Property / cites work
 
Property / cites work: How much do we ``pay'' for using default parameters? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards unified formulations and extensions of two classical probabilistic location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network repair crew scheduling for short-term disasters / 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: Network repair crew scheduling and routing for emergency relief distribution problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / 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: The Benders decomposition algorithm: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition based hybrid metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated optimal scheduling of repair crew and relief vehicle after disaster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures / rank
 
Normal rank

Latest revision as of 15:32, 22 July 2024

scientific article
Language Label Description Also known as
English
Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
scientific article

    Statements

    Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    Benders decomposition
    0 references
    branch-and-Benders-cut
    0 references
    decomposition-based metaheuristic
    0 references
    hybrid method
    0 references
    crew scheduling and routing
    0 references
    road restoration
    0 references
    0 references
    0 references
    0 references
    0 references