scientific article; zbMATH DE number 3069634
From MaRDI portal
Publication:5808754
zbMATH Open0045.09901MaRDI QIDQ5808754FDOQ5808754
Authors: George Dantzig 
Publication date: 1951
Title of this publication is not available (Why is that?)
Cited In (38)
- A convex analysis view of the barrier problem
- A survey of models and algorithms for winter road maintenance. II: System design for snow disposal
- On the stability of solutions of the transport problem in linear programming
- Solution of the personnel classification problem with the method of optimal regions
- An evolutionary heuristic algorithm for the assignment problem
- A method for solving a fuzzy transportation problem via Robust ranking technique and ATM
- On implementing push-relabel method for the maximum flow problem
- Structure of solutions for continuous linear programs with constant coefficients
- Chance constrained bottleneck transportation problem with preference of routes
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Eine Erweiterung des Transportproblems
- Uncertain transportation model with rough unit cost, demand and supply
- A network simplex method for the budget-constrained minimum cost flow problem
- An intuitionistic fuzzy zero suffix method for solving the transportation problem
- Entropical optimal transport, Schrödinger's system and algorithms
- CLOUD computing risk management for server-farm repair rates, consumer load cycle, server-farm repair crew count, and additional servers
- Foundations of operations research: from linear programming to data envelopment analysis
- On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness
- Über das Transportproblem mit beliebigen zusätzlichen linearen Nebenbedingungen
- An experimental study of newly proposed initial basic feasible solution methods for a transportation problem
- Primal transportation and transshipment algorithms
- Polyhedral proof methods in combinatorial optimization
- Multistage production-distribution problem
- Enhanced instance space analysis for the maximum flow problem
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- Online facility assignment
- Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
- A simplex-type algorithm for continuous linear programs with constant coefficients
- A network simplex method
- Computational experience with exterior point algorithms for the transportation problem
- Title not available (Why is that?)
- Maximum difference extreme difference method for finding the initial basic feasible solution of transportation problems
- Stochastic bottleneck transportation problem with flexible supply and demand quantity
- Une nouvelle méthode d'initialisation pour le problème de transport
- Recent developments in maximum flow algorithms
- The sector design and assignment problem for snow disposal operations
- Total unimodularity and the Euler-subgraph problem
- The dynamic multilevel assignment problem as a stochastic extremal process
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5808754)
