Pages that link to "Item:Q1849524"
From MaRDI portal
The following pages link to The many facets of linear programming (Q1849524):
Displaying 33 items.
- Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs (Q480938) (← links)
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Constructing convex 3-polytopes from two triangulations of a polygon (Q598553) (← links)
- A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- An overview on the simplex algorithm (Q1021548) (← links)
- Local base station assignment with time intervals in mobile computing environments (Q1877045) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Design of cross-directional controllers with optimal steady state performance (Q2511862) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable (Q2925352) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Some fundamental issues of basic line search algorithm for linear programming problems (Q3066936) (← links)
- Obstructions to weak decomposability for simplicial polytopes (Q3190213) (← links)
- Dual–primal algorithm for linear optimization (Q4924118) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- Book Review: The basic George B. Dantzig (Q5494765) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
- Constraint learning: an appetizer (Q6535988) (← links)
