scientific article; zbMATH DE number 1947061

zbMATH Open1013.90126MaRDI QIDQ4411291FDOQ4411291

Authors: Artur Alves Pessoa, Ruy L. Milidiú, Eduardo S. Laber 

Publication date: 7 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620243.htm

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of makespan minimization for pipeline transportation.
• scientific article; zbMATH DE number 2086233
• Algorithms and Computation
• Planning of multi-product pipelines by economic lot scheduling models
• Complexity Of The Single Vehicle Scheduling Problem On Graphs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)

Cited In (4)

• Title not available (Why is that?)
• The complexity of makespan minimization for pipeline transportation.
• Algorithms and Computation
• Limitation and modification: On a cost pipeline trade-off in a transportation problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411291)