The following pages link to (Q3844775):
Displayed 50 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- One-point suspensions and wreath products of polytopes and spheres (Q556855) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- A duality theorem for linear congruences (Q585086) (← links)
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- Yet another geometric programming dual algorithm (Q593984) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- The binary search decomposition in a decentralized organization (Q599688) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- Extension of GAMS for complementarity problems arising in applied economic analysis (Q672669) (← links)
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution (Q684320) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- On the equivalence of the simplex methods and a multiplier-alike method for linear programming (Q700716) (← links)
- An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. (Q703240) (← links)
- Optimization: A case for the development of new mathematical concepts (Q749440) (← links)
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- Fast detection of polyhedral intersection (Q759483) (← links)
- Linear quadratic programming in oriented matroids (Q760437) (← links)
- Archimedean qualitative probabilities (Q762821) (← links)
- Conjugate cone characterization of positive definite and semidefinite matrices (Q787230) (← links)
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- Dual simplex method for GUB problems (Q790706) (← links)
- The simplex method and unrestricted variables (Q790709) (← links)
- An algebraic approach to shape-from-image problems (Q792776) (← links)
- Lower subdifferentiable functions and their minimization by cutting planes (Q795741) (← links)
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra (Q798004) (← links)
- Approximation theorems for positive operators on \(L^ p\)-spaces (Q803453) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- The decomposition principle and algorithms for linear programming (Q806964) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Non-convex power plant modelling in energy optimisation (Q819111) (← links)
- On the orthogonal Latin squares polytope (Q819807) (← links)
- Efficient algorithms for combined heat and power production planning under the deregulated electricity market (Q852994) (← links)
- On using priced timed automata to achieve optimal scheduling (Q853729) (← links)
- Model checking of time Petri nets using the state class timed automaton (Q859736) (← links)
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) (← links)
- On Hoffman's celebrated cycling LP example (Q875416) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- A simple approach to optimal control of invasive species (Q884307) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- Sparse dual transportation polyhedra: Extreme points and signatures (Q911458) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- The linearized version of an algorithm for the mixed norms problem (Q912569) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Unrestricted variables in linear programming (Q915645) (← links)
- A stochastic geometric programming problem with multiplicative recourse (Q916566) (← links)
- A survey of dynamic network flows (Q917417) (← links)