Discrete optimization: an Austrian view
type: Item
instance of: scholarly article
title: Discrete optimization: an Austrian view
zbMATH Open document ID: 1213.90012
author: Rainer E. Burkard
published in: Annals of Operations Research
publication date: 2011-05-20T00:00:00Z
Mathematics Subject Classification ID: 90-03
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5898423
MaRDI profile type: Publication
full work available at URL: s10479-006-0089-5
OpenAlex ID: W2076762793
cites work: An asymptotical study of combinatorial optimization problems by means of statistical mechanics
cites work: Q5648149
cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
cites work: Probabilistic asymptotic properties of some combinatorial optimization problems
cites work: An algebraic approach to assignment problems
cites work: Perspectives of Monge properties in optimization
cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
cites work: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
cites work: Inverse median problems
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: Q3942759
cites work: Q3747197
cites work: Q4517107
cites work: Q5557602
cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
cites work: Linear and combinatorial optimization in ordered algebraic structures
DOI: 10.1007/S10479-006-0089-5
description: scientific article; zbMATH DE number 5898423