The following pages link to Uwe T. Zimmermann (Q1018087):
Displaying 50 items.
- (Q581205) (redirect page) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- (Q801131) (redirect page) (← links)
- Eigenfunctions and optimal orbits (Q801132) (← links)
- Shunting minimal rail car allocation (Q812422) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- Performance evaluation of vector implementations of combinatorial algorithms (Q1062729) (← links)
- On the solution of nonlinear inequalities in a finite number of iterations (Q1067365) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- Strong linear independence in bottleneck algebra (Q1094338) (← links)
- Duality for algebraic linear programming (Q1142711) (← links)
- Linear and combinatorial optimization in ordered algebraic structures (Q1155513) (← links)
- (Q1167657) (redirect page) (← links)
- Minimization on submodular flows (Q1167658) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- Negative circuits for flows and submodular flows (Q1192951) (← links)
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
- An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
- Optimal lines for railway systems (Q1278454) (← links)
- The decomposition principle and algorithms for linear programs under interior point method. I, II (Q1312935) (← links)
- Strong regularity of matrices -- a survey of results (Q1314327) (← links)
- On the complexity of the dual method for maximum balanced flows (Q1324690) (← links)
- Fast algorithms for the maximum convolution problem (Q1332943) (← links)
- (Q1365067) (redirect page) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Real-time dispatch of trams in storage yards (Q1593542) (← links)
- A faster capacity scaling algorithm for minimum cost submodular flow (Q1600097) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- A polynomial cycle canceling algorithm for submodular flows (Q1806021) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- A sharp deviation inequality for the stochastic traveling salesman problem (Q1824393) (← links)
- Generalized edge packings (Q1825138) (← links)
- Inequalities for the gamma function with applications to permanents (Q1918538) (← links)
- Cost optimal periodic train scheduling (Q2433233) (← links)
- Flexible job shop scheduling with blockages (Q2454071) (← links)
- (Q2762577) (← links)
- (Q2762579) (← links)
- On Minimum k-Modal Partitions of Permutations (Q3525774) (← links)
- (Q3682270) (← links)
- (Q3683850) (← links)
- Nonlinear one-parametric bottleneck linear programming (Q3693286) (← links)
- (Q3706840) (← links)
- Sharing problems (Q3720309) (← links)
- (Q3725833) (← links)
- (Q3786270) (← links)
- A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems (Q3833847) (← links)