An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10878-014-9755-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029639072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint programming approach to the Chinese postman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test generation for interaction detection in feature-rich communication systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed general routing polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Mixed General Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routeing winter gritting vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the undirected rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum-cost circulations by canceling negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the windy postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Approaches to Software Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving several classes of arc routing problems as traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated arc routing problems using a transformation to the CVRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for the mixed Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming arc routing into node routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc routing problems with time-dependent service costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent rural postman problem: polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-constrained Chinese postman problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:21, 10 July 2024

scientific article
Language Label Description Also known as
English
An integer programming approach for the Chinese postman problem with time-dependent travel time
scientific article

    Statements

    An integer programming approach for the Chinese postman problem with time-dependent travel time (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2015
    0 references
    time-dependent
    0 references
    Chinese postman problem
    0 references
    polyhedral combinatorics
    0 references
    valid inequalities
    0 references
    cycle-path formulation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers