Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches

DOI10.1007/978-3-540-87477-5_3zbMath1160.90625OpenAlexW1967908726MaRDI QIDQ3627669

Tao Pham Dinh, Babacar Mbaye Ndiaye, Hoai An Le Thi

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_3

zbMATH Keywords

vehicle routingcutting plane techniquescontainer portstraddle carrierDC (Difference of convex functions) programmingDCA (DC algorithm)nonconvex optimization-global optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

DC programming and DCA: thirty years of developments

Uses Software

• CPLEX

Cites Work

• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Exact penalty in d. c. programming
• Deriving decision rules to locate export containers in container yards
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A continuous approch for globally solving linearly constrained quadratic
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Classical cuts for mixed-integer programming and branch-and-cut

This page was built for publication: Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches