2015
DOI: 10.1016/j.cirpj.2015.01.007
|View full text |Cite
|
Sign up to set email alerts
|

Graph-based integrated production and intermodal transport scheduling with capacity restrictions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Fulfillment of the condition ( 5) or (11) in the model of the above transport problem, the fulfillment of the requirement of consumption of raw materials of FPMP by all recipients, shows the fulfillment of the transportation volume that should be from all shippers according to the condition ( 6) or (12). In general, the algorithm for solving the transportation problem can be as follows [18,19]:…”
Section: Methods and Modelmentioning
confidence: 99%
“…Fulfillment of the condition ( 5) or (11) in the model of the above transport problem, the fulfillment of the requirement of consumption of raw materials of FPMP by all recipients, shows the fulfillment of the transportation volume that should be from all shippers according to the condition ( 6) or (12). In general, the algorithm for solving the transportation problem can be as follows [18,19]:…”
Section: Methods and Modelmentioning
confidence: 99%
“…Dvořák in (Dvořák, 2013) shows the constant-factor approximation of the domination number in sparse graphs. Scholz-Reiter, Makuschewitz and Frazzon in (Ehm et al, 2015) examine the graph-based integrated production and intermodal transport scheduling with capacity restrictions. From Feller's book (Feller, 1957) we can study the general aspect of probability.…”
Section: Introductionmentioning
confidence: 99%