Journal article · 2011

A branch and cut algorithm for the container shipping network design problem

Line Blander Reinhardt, David Pisinger

Flexible Services and Manufacturing Journal, 24(3), 349–374 · Published 15 July 2011 · DOI 10.1007/s10696-011-9105-4

View at the publisherCite this paper

In brief

“A branch and cut algorithm for the container shipping network design problem” is a 2011 journal article by Line Blander Reinhardt and David Pisinger, published in Flexible Services and Manufacturing Journal. OpenAlex counts 140 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
140
Most cited in
2020 (18)
Field-weighted impact
26.69
References
24
Authors
2

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Reinhardt, L. B., & Pisinger, D. (2011). A branch and cut algorithm for the container shipping network design problem. Flexible Services and Manufacturing Journal, 24(3), 349–374. https://doi.org/10.1007/s10696-011-9105-4

MLA 9

Reinhardt, Line Blander, and David Pisinger. “A branch and cut algorithm for the container shipping network design problem.” Flexible Services and Manufacturing Journal, vol. 24, no. 3, 2011, pp. 349–374. https://doi.org/10.1007/s10696-011-9105-4.

Chicago

Reinhardt, Line Blander and David Pisinger. 2011. “A branch and cut algorithm for the container shipping network design problem.” Flexible Services and Manufacturing Journal 24 (3): 349–374. https://doi.org/10.1007/s10696-011-9105-4.

Harvard

Reinhardt, L. B. and Pisinger, D. (2011) ‘A branch and cut algorithm for the container shipping network design problem’, Flexible Services and Manufacturing Journal, 24(3), pp. 349–374. doi:10.1007/s10696-011-9105-4.

IEEE

L. B. Reinhardt and D. Pisinger, “A branch and cut algorithm for the container shipping network design problem,” Flexible Services and Manufacturing Journal, vol. 24, no. 3, pp. 349–374, 2011, doi: 10.1007/s10696-011-9105-4.

BibTeX

@article{reinhardt2011branch,
  title     = {{A branch and cut algorithm for the container shipping network design problem}},
  author    = {Reinhardt, Line Blander and Pisinger, David},
  journal   = {Flexible Services and Manufacturing Journal},
  year      = {2011},
  volume    = {24},
  number    = {3},
  pages     = {349--374},
  doi       = {10.1007/s10696-011-9105-4},
  url       = {https://doi.org/10.1007/s10696-011-9105-4}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20171111
20181010
20191313
20201818
202166
202222
202388
202444
202522
202633

Its field-weighted citation impact is 26.69: it has been cited 26.69 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Maritime Ports and Logistics

  • liner shipping
  • fleet assignment
  • branch-and-cut
  • heterogeneous fleet
  • mixed-integer linear programming
  • exact algorithms

Work with this paper

Most-cited papers in Engineering

All highly cited Engineering papers

Questions about this paper

How do I cite this paper in APA style?

Reinhardt, L. B., & Pisinger, D. (2011). A branch and cut algorithm for the container shipping network design problem. Flexible Services and Manufacturing Journal, 24(3), 349–374. https://doi.org/10.1007/s10696-011-9105-4

How many times has this paper been cited?

140 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Line Blander Reinhardt, David Pisinger.

What is the DOI of this paper?

10.1007/s10696-011-9105-4, permanently at https://doi.org/10.1007/s10696-011-9105-4. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.