On the History of Combinatorial Optimization (Till 1960)

DOI10.1016/S0927-0507(05)12001-5zbMath1278.90006MaRDI QIDQ5292083

Alexander Schrijver

Publication date: 19 June 2007

Published in: Discrete Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

90C27: Combinatorial optimization

01A60: History of mathematics in the 20th century

90-03: History of operations research and mathematical programming

Related Items

Alexander r-tuples and bier complexes, A weighted perfect matching with constraints on weights of its parts, A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals, A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs, Simulation Hemi-metrics between Infinite-State Stochastic Games, Advances in Constrained Connectivity, Book Review: The basic George B. Dantzig, Minimum Cuts in Surface Graphs, Optimization via rejection-free partial neighbor search, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Balanced fuzzy particle swarm optimization, Riemann-Roch theory for graph orientations, Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication, Exact and heuristic algorithms for the interval data robust assignment problem, Jacobi's bound for independent systems of algebraic partial differential equations, Outer linear measure of connected sets via Steiner trees, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, Multicuts in planar and bounded-genus graphs with bounded number of terminals, Jacobi's bound for a diffiety defined by a quasi-regular system, Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries, MAINTENANCE GOALS IN INTELLIGENT AGENTS