Discrete optimization: an Austrian view

DOI10.1007/S10479-006-0089-5MaRDI QIDQ537581zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard

Publication date 20 May 2011

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0089-5

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03) Integer programming (90C10)

Cites work

• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• An algebraic approach to assignment problems
• An asymptotical study of combinatorial optimization problems by means of statistical mechanics
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
• scientific article; zbMATH DE number 3982880 (Why is no real title available?)
• scientific article; zbMATH DE number 3759934 (Why is no real title available?)
• scientific article; zbMATH DE number 1534298 (Why is no real title available?)
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• scientific article; zbMATH DE number 3376984 (Why is no real title available?)
• Inverse median problems
• Linear and combinatorial optimization in ordered algebraic structures
• Perspectives of Monge properties in optimization
• Probabilistic asymptotic properties of some combinatorial optimization problems
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

This page was built for publication: Discrete optimization: an Austrian view

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537581)