Polynomial dual network simplex algorithms

Polynomial dual network simplex algorithms

Bibliographic Details
Main Authors:	Orlin, James B., Plotkin, Serge A., Tardos, va
Other Authors:	Sloan School of Management.
Format:	Working Paper
Published:	Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2009
Online Access:	http://hdl.handle.net/1721.1/48777

Similar Items

Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
by: Orlin, James B.
Published: (2009)

Combinatorial Algorithms for the Generalized Circulation Problem
by: Goldberg, Andrew V., et al.
Published: (2023)

A polynomial time primal network simplex algorithm for minimum cost flows
Published: (2003)

Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
by: Ahuja, Ravindra K., et al.
Published: (2009)

A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Published: (2003)

On the simplex algorithm for networks and generalized networks
Published: (2003)

Predicting the Execution Time of the Primal and Dual Simplex Algorithms Using Artificial Neural Networks
by: Sophia Voulgaropoulou, et al.
Published: (2022-03-01)

Equivalence of primal and dual simplex algorithms for the maximum flow problem
Published: (2003)

An Efficient Extension of Network Simplex Algorithm
by: Hassan Rashidi, et al.
Published: (2010-02-01)

Complete polynomial vector fields in simplexes with application to evolutionary dynamics
by: N. M. Ben Yousif
Published: (2004-02-01)

Polynomial time algorithms for dual volume sampling
by: Li, C, et al.
Published: (2021)

Polynomial time algorithms for dual volume sampling
by: Li, Chengtao, et al.
Published: (2022)

A Faster Primal Network Simplex Algorithm
by: Aggarwal, Charu C., et al.
Published: (2004)

MINVO Basis: Finding Simplexes with Minimum Volume Enclosing Polynomial Curves
by: Tordesillas, Jesus, et al.
Published: (2022)

Clamping-simplex methods : improved direct search simplex algorithms
by: Szeto, Raymond W. L. (Raymond Wen Li), 1977-
Published: (2014)

Approximation Hierarchies for the Copositive Tensor Cone and Their Application to the Polynomial Optimization over the Simplex
by: Muhammad Faisal Iqbal, et al.
Published: (2022-05-01)

Dual Artificial Variable-Free Simplex Algorithm for Solving Neutrosophic Linear Programming Problems
by: Aya Rabie, et al.
Published: (2021-10-01)

New criteria for simplex algorithm /
by: 466178 Cheng, M. C.
Published: (1978)

A polynomial algorithm for the braid double shielded public key cryptosystems
by: V.A. Roman’kov
Published: (2016-12-01)

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
by: Halman, Nir, et al.
Published: (2017)

Randomized algorithms for finding the shortest negative cost cycle in networks
by: Orlin, James B, et al.
Published: (2020)

Dual combinatorics of zonal polynomials
by: Valentin Féray, et al.
Published: (2011-01-01)

Robust simplex algorithm for online optimization
by: Xiaobiao Huang
Published: (2018-10-01)

Network flows : theory, algorithms, and applications /
by: 378088 Ahuja, Ravindra K., et al.
Published: (1993)

Improved Algorithms for Computing Fisher's Market Clearing Prices
by: Orlin, James B.
Published: (2012)

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
by: Magnanti, Thomas L., et al.
Published: (2012)

Algorithm design /
by: 255951 Kleinberg, Jon, et al.
Published: (2006)

Linear Programming, the Simplex Algorithm and Simple Polytopes
by: Das Bhusan, et al.
Published: (2010-09-01)

Simplifications and speedups of the pseudoflow algorithm
by: Hochbaum, Dorit S., et al.
Published: (2013)

A scaling algorithm for multicommodity flow problems
by: Schneur, Rina., et al.
Published: (2009)

A simple combinatorial algorithm for submodular function minimization
by: Iwata, Satoru, et al.
Published: (2011)

Efficient Parallel Algorithms for (_+1)-coloring and Maximal Indepdendent Set Problems
by: Goldberg, Andrew V., et al.
Published: (2023)

Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
by: Joanna Raczek
Published: (2022-01-01)

A fast maximum flow algorithm
by: Orlin, James B, et al.
Published: (2021)

Primal dual algoritma dalam program linear simplex versus interior point
by: , AGUSTAF, Rusdy, et al.
Published: (2002)

Algorithms for polynomial and rational approximation
by: Pachon, R
Published: (2010)

Polynomial algorithms in computer algebra /
by: 347079 Winkler, Franz
Published: (1996)

An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem
by: Sapan Kumar Das, et al.
Published: (2020-09-01)

A fast and simple algorithm for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

A fast and simple algorithm for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)