Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems: Label: en
Convergence of an annealing algorithm: Label: en
On the complexity of four polyhedral set containment problems: Label: en
A decomposition property of polyhedra: Label: en
How bad are the BFGS and DFP methods when the objective function is quadratic?: Label: en
The Fermat—Weber location problem revisited: Label: en
Benchmarking optimization software with performance profiles: Label: en
A Stochastic Successive Minimization Method for Nonsmooth Nonconvex Optimization with Applications to Transceiver Design in Wireless Communication Networks: Label: en
Practical convergence conditions for unconstrained optimization: Label: en
Generalized dynamic programming methods in integer programming: Label: en
Exact penalty functions in nonlinear programming: Label: en
A quadratically-convergent algorithm for general nonlinear programming problems: Label: en
Edmonds polytopes and weakly hamiltonian graphs: Label: en
An “out-of-kilter” algorithm for solving minimum cost potential problems: Label: en
Discrete optimization on a multivariable boolean lattice: Label: en
A cofferdam design optimization: Label: en
Inverse programming: Theory and examples: Label: en
Pivot selection methods of the Devex LP code: Label: en
A superlinearly convergent method for minimization problems with linear inequality constraints: Label: en
Homotopies for computation of fixed points on unbounded regions: Label: en
On search directions for minimization algorithms: Label: en
Investigation of some branch and bound strategies for the solution of mixed integer linear programs: Label: en
A computational comparison of some non-linear programs: Label: en
An efficient one—dimensional search procedure for barrier functions: Label: en
Convex analysis treated by linear programming: Label: en
Two-commodity cut-packing problem: Label: en
Integer programming and convex analysis: Intersection cuts from outer polars: Label: en
A new solvable case of the traveling salesman problem: Label: en
A note on Fermat's problem: Label: en
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs: Label: en
On the equivalence of some generalized network problems to pure network problems: Label: en
Two commodity network flows and linear programming: Label: en
Mathematical programming problems with quasi-convex objective functions: Label: en
Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions: Label: en
Computational experience with a group theoretic integer programming algorithm: Label: en
On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm: Label: en
Hybrid computation in mathematical programming: Label: en
Blocking and anti-blocking pairs of polyhedra: Label: en
A projective method for structured nonlinear programs: Label: en
Problems and methods with multiple objective functions: Label: en
Some continuous functions related to corner polyhedra, II: Label: en
A partitioning algorithm for the multicommodity network flow problem: Label: en
Quasi Newton techniques generate identical points II: The proofs of four new theorems: Label: en
Proximate linear programming: A variable extreme point method: Label: en
Plane sections of simplices: Label: en
On “an efficient algorithm for minimizing barrier and penalty functions”: Label: en
Generation of all integer points for given sets of linear inequalities: Label: en
Matroids and the greedy algorithm: Label: en
An algorithm for solving linearly constrained optimization problems: Label: en
r-convex functions: Label: en