On the History of Combinatorial Optimization (Till 1960)
From MaRDI portal
Publication:5292083
DOI10.1016/S0927-0507(05)12001-5zbMath1278.90006MaRDI QIDQ5292083
Publication date: 19 June 2007
Published in: Discrete Optimization (Search for Journal in Brave)
Combinatorial optimization (90C27) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items (22)
Minimum Cuts in Surface Graphs ⋮ MAINTENANCE GOALS IN INTELLIGENT AGENTS ⋮ Jacobi's bound for a diffiety defined by a quasi-regular system ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ A weighted perfect matching with constraints on weights of its parts ⋮ Optimization via rejection-free partial neighbor search ⋮ Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication ⋮ 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 ⋮ Exact and heuristic algorithms for the interval data robust assignment problem ⋮ Balanced fuzzy particle swarm optimization ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals ⋮ Riemann-Roch theory for graph orientations ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ Simulation Hemi-metrics between Infinite-State Stochastic Games ⋮ Advances in Constrained Connectivity ⋮ Jacobi's bound for independent systems of algebraic partial differential equations ⋮ Outer linear measure of connected sets via Steiner trees ⋮ Alexander r-tuples and bier complexes ⋮ Book Review: The basic George B. Dantzig
This page was built for publication: On the History of Combinatorial Optimization (Till 1960)
