The following pages link to (Q3050157):
Displaying 50 items.
- Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point (Q261538) (← links)
- Single-projection procedure for linear optimization (Q330507) (← links)
- Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization (Q332770) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Selectivity in probabilistic causality: where psychology runs into quantum physics (Q423115) (← links)
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Sequential virtual motion camouflage method for nonlinear constrained optimal trajectory control (Q445945) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Scheduling ordered open shops (Q580167) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- A brief history of the international symposia on mathematical programming (Q607500) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Positive diagonal scaling of a nonnegative tensor to one with prescribed slice sums (Q630503) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- The double pivot simplex method (Q684156) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Interactive multiple objective optimization: Survey. I: Continuous case (Q750284) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- A new polynomial-time algorithm for linear programming (Q761967) (← links)
- Scl in graphs of groups (Q785926) (← links)
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints (Q791440) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Updating beliefs with incomplete observations (Q814629) (← links)
- KBO orientability (Q846165) (← links)
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- An algorithm for linear programming that is easy to implement (Q917443) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
