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)
90C27: Combinatorial optimization
01A60: History of mathematics in the 20th century
90-03: History of operations research and mathematical programming
Related Items
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, 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, 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
