Pages that link to "Item:Q5292083"
From MaRDI portal
The following pages link to On the History of Combinatorial Optimization (Till 1960) (Q5292083):
Displaying 15 items.
- Balanced fuzzy particle swarm optimization (Q438037) (← links)
- Riemann-Roch theory for graph orientations (Q509688) (← links)
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication (Q623798) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Jacobi's bound for independent systems of algebraic partial differential equations (Q1015368) (← links)
- Outer linear measure of connected sets via Steiner trees (Q2054562) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Jacobi's bound for a diffiety defined by a quasi-regular system (Q2643115) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- MAINTENANCE GOALS IN INTELLIGENT AGENTS (Q3462268) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- Optimization via rejection-free partial neighbor search (Q6085191) (← links)
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages (Q6166083) (← links)
