scientific article; zbMATH DE number 1487887

MaRDI QIDQ4494417zbMATH OpenFDO

Authors Lutz Kämmerer, Lorenz Hempel

Publication date 5 August 2001

zbMATH Keywords

branch-and-bound algorithmdiscrete optimizationengineeringloading and unloading trains trucks or shipslogistics

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Numerical solution of a pile problem
• Matrix solution to Gergonne's pile problem
• A mathematical programming viewpoint for solving the ultimate pit problem
• On the numerical solution of a class of Stackelberg problems
• scientific article; zbMATH DE number 19349
• On a problem of Pillai and its generalizations
• On a problem concerning piles of counters
• Poncelet-type problems, an elementary approach
• scientific article; zbMATH DE number 3051051

Cited in

(3)

• Storage controlled pile-up systems, theoretical foundations
• The Gergonne \(p\)-pile problem and the dynamics of the function \(x\mapsto\lfloor (x + r)/p\rfloor\)
• scientific article; zbMATH DE number 1264407 (Why is no real title available?)

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