Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5 (Q1360245) (← links)
- Nondegeneracy of polyhedra and linear programs (Q1360246) (← links)
- An algorithm for continuous type optimal location problem (Q1360248) (← links)
- A comparison of large scale mixed complementarity problem solvers (Q1363058) (← links)
- Impact of partial separability on large-scale optimization (Q1363059) (← links)
- On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds (Q1363060) (← links)
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization (Q1363061) (← links)
- Sparse linear least squares problems in optimization (Q1363062) (← links)
- Simulated annealing and genetic algorithms for the facility layout problem: A survey (Q1363064) (← links)
- Sequential quadratic programming methods for large-scale problems (Q1363065) (← links)
- A scalable parallel interior point algorithm for stochastic linear programming and robust optimization (Q1363067) (← links)
- Solving large quadratic assignment problems in parallel (Q1366297) (← links)
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems (Q1366299) (← links)
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (Q1366300) (← links)
- A hypergraph framework for optimal model-based decomposition of design problems (Q1366302) (← links)
- An optimal algorithm to find the jump number of partially ordered sets (Q1366304) (← links)
- Metric-based symmetric rank-one updates (Q1369362) (← links)
- On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs (Q1369364) (← links)
- A note on reducing the number of variables in integer programming problems (Q1369365) (← links)
- An infeasible point method for minimizing the Lennard-Jones potential (Q1369366) (← links)
- A truncated exponential algorithm for the lightly constrained assignment problem (Q1369367) (← links)
- Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722) (← links)
- Finding postal carrier walk paths in mixed graphs (Q1380723) (← links)
- A parallel interior point method and its application to facility location problems (Q1380725) (← links)
- Metaheuristics for high school timetabling (Q1380726) (← links)
- Decomposition methods for differentiable optimization problems over Cartesian product sets (Q1383825) (← links)
- Local convergence of the symmetric rank-one iteration (Q1383826) (← links)
- Using forward accumulation for automatic differentiation of implicitly-defined functions (Q1383827) (← links)
- The minimum covering \(l_{pb}\)-hypersphere problem (Q1383828) (← links)
- A constant-potential infeasible-start interior-point algorithm with computational experiments and applications (Q1383829) (← links)
- A hybrid smoothing method for mixed nonlinear complementarity problems (Q1383830) (← links)
- An interior-point method for approximate positive semidefinite completions (Q1383832) (← links)
- Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions (Q1383833) (← links)
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints (Q1383834) (← links)
- Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces (Q1383836) (← links)
- On the existence and convergence of the central path for convex programming and some duality results (Q1383837) (← links)
- Quadratic and superlinear convergence of the Huschens method for nonlinear least squares problems (Q1383838) (← links)
- Feature minimization within decision trees (Q1384090) (← links)
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel (Q1384091) (← links)
- Global optimization techniques for solving the general quadratic integer programming problem (Q1384092) (← links)
- The capacitated arc routing problem: Valid inequalities and facets (Q1384095) (← links)
- Projection with a minimal system of inequalities (Q1384096) (← links)
- On the solution of linear recurrence equations (Q1384098) (← links)
- A quasi-Newton penalty barrier method for convex minimization problems (Q1410237) (← links)
- Feasible interior methods using slacks for nonlinear optimization (Q1410239) (← links)
- A piecewise linear dual phase-1 algorithm for the simplex method (Q1410240) (← links)
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation (Q1410241) (← links)
- The incremental Gauss-Newton algorithm with adaptive stepsize rule (Q1415481) (← links)
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions (Q1415482) (← links)
- A branch and bound method for solving integer separable concave problems (Q1415483) (← links)
