Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints (Q3767114): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58117301, #quickstatements; #temporary_batch_1710865376617
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.1080/01966324.1986.10737197 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979295983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with time windows by column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing vehicle routing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Effective Heuristic for the <i>M</i>-Tour Traveling Salesman Problem with Some Side Conditions / rank
 
Normal rank

Latest revision as of 12:12, 18 June 2024

scientific article
Language Label Description Also known as
English
Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
scientific article

    Statements

    Identifiers