swMATH31782MaRDI QIDQ43493FDOQ43493
Author name not available (Why is that?)
Official website: https://vanderbei.princeton.edu/LPbook/src/index.html
Cited In (51)
- The fractional minimal cost flow problem on network
- Improved linear programming methods for checking avoiding sure loss
- Finite-time stability and stabilisation of singular discrete-time linear positive systems with time-varying delay
- The learnability of voting rules
- Type-based amortized resource analysis with integers and arrays
- Vanishing price of decentralization in large coordinative nonconvex optimization
- Some fundamental issues of basic line search algorithm for linear programming problems
- A simplex based algorithm to solve separated continuous linear programs
- Minimal positive stencils in meshfree finite difference methods for the Poisson equation
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- Minimum norm interpolation in the \(\ell_1(\mathbb{N})\) space
- Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties
- Modification and implementation of two-phase simplex method
- A two-phase support method for solving linear programs: numerical experiments
- Quantile regression with monotonicity restrictions using P-splines and the L1-norm
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
- Steplength selection in interior-point methods for quadratic programming
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- A fast method for a class of one-stage bounded variables and single constrained linear programming problems
- On the fractional chromatic number of monotone self-dual Boolean functions
- A semidefinite programming approach for solving multiobjective linear programming
- A penalized method for multivariate concave least squares with application to productivity analysis
- Performance of algebraic multigrid methods for non-symmetric matrices arising in particle methods
- Quadratic optimization in the problems of active control of sound
- LPAKO
- A policy approximation method for the UMTS connection admission control problem modelled as an MDP
- MarPlex
- GameShrink
- Equality detection for linear arithmetic constraints
- l1_ls
- Constraint consensus methods for finding interior feasible points in second-order cones
- The final NETLIB-LP results
- Model approximation for batch flow shop scheduling with fixed batch sizes
- LPCCbnc
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Difference sets and positive exponential sums. I: General properties
- Noncooperative foundations of the nucleolus in majority games
- A new LP formulation of the admission control problem modelled as an MDP under average reward criterion
- Legendre transform and applications to finite and infinite optimization
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
- Moment growth bounds on continuous time Markov processes on non-negative integer lattices
- Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Currency arbitrage detection using a binary integer programming model
- Stability analysis of a class of nonlinear positive switched systems with delays
- On the simplex algorithm initializing
- George B. Dantzig and systems optimization
- LP approach to exponential stabilization of singular linear positive time-delay systems via memory state feedback
- A simple direct cosine simplex algorithm
This page was built for software: LPbook
