scientific article; zbMATH DE number 5056702

zbMATH Open1099.65053MaRDI QIDQ5488955FDOQ5488955

Takaaki Egawa, Hiroshi Konno

Publication date: 25 September 2006

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

Recommendations

• Probabilistic local search algorithms for concave cost transportation network problems
• scientific article; zbMATH DE number 609997
• Optimizing large on-demand transportation systems through stochastic conic programming
• The decomposition of optimal transportation problems with convex cost
• The nonlinear generalized transportation problem with convex costs
• Solution of large dense transportation problems using a parallel primal algorithm
• Global and local search algorithms for concave cost transshipment problems
• scientific article; zbMATH DE number 4027167
• Optimization-based modeling with applications to transport. III. Computational studies

zbMATH Keywords

piecewise linear approximationinteger programmingconcave minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Cited In (4)

• Probabilistic local search algorithms for concave cost transportation network problems
• Max-min sum minimization transportation problem
• Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems
• An adaptive tabu-simulated annealing for concave cost transportation problems

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 Q5488955)