Discrete optimization: an Austrian view
From MaRDI portal
Publication:537581
DOI10.1007/s10479-006-0089-5zbMath1213.90012OpenAlexW2076762793MaRDI QIDQ537581
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
Integer programming (90C10) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Linear and combinatorial optimization in ordered algebraic structures
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Perspectives of Monge properties in optimization
- Inverse median problems
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- An algebraic approach to assignment problems
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
This page was built for publication: Discrete optimization: an Austrian view
