Keyword: programming: quadratic

Found 433 papers in total
Single machine scheduling with start time dependent processing times: Some solvable cases
Single machine scheduling with start time dependent processing times: Some solvable cases
1994,
This paper considers a generalized one machine maximum lateness problem with fuzzy...
A simple algorithm to incorporate transactions costs in quadratic optimisation
A simple algorithm to incorporate transactions costs in quadratic optimisation
1994,
Quantitative fund management invariably involves portfolio performance being measured...
Containing groundwater contamination: Planning models using stochastic programming with recourse
Containing groundwater contamination: Planning models using stochastic programming with recourse
1994,
This paper examines the problem of operating pumping wells in order to contain an area...
A diagnostic model for improving the efficiency of an existing portfolio
A diagnostic model for improving the efficiency of an existing portfolio
1994,
This paper focuses on one particular aspect of portfolio revision, that is, the case...
A 2-person game on a polyhedral set of connected strategies
A 2-person game on a polyhedral set of connected strategies
1997,
A 2-person zero-sum game with the payoff function being a sum of two linear functions...
A parallel primal-dual interior point method for multicommodity flow problems with quadratic costs
A parallel primal-dual interior point method for multicommodity flow problems with quadratic costs
1996,
The authors present a parallel implementation of a primal-dual interior point method...
The solution of a bidimensional diffusion equation
The solution of a bidimensional diffusion equation
1995,
One of the most important uses of numerical methods in nuclear engineering is in the...
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
1996,
This paper shows that an analogue of the classical conjugate gradient method converges...
A parallel inexact Newton method for stochastic programs with recourse
A parallel inexact Newton method for stochastic programs with recourse
1996,
A parallel inexact Newton method with a line search is proposed for two-stage...
On the complexity of finding stationary points of nonconvex quadratic programs
On the complexity of finding stationary points of nonconvex quadratic programs
1996,
The authors establish that a linear complementarity problem associated with an...
On tabu search for the location of interacting hub facilities
On tabu search for the location of interacting hub facilities
1994,
A new heuristic method based on tabu search is developed for the problem of locating p...
A path-following interior-point algorithm for linear and quadratic problems
A path-following interior-point algorithm for linear and quadratic problems
1996,
The paper describes an algorithm for the monotone linear complementarity problem (LCP)...
The complexity of approximating a nonlinear program
The complexity of approximating a nonlinear program
1995,
The authors consider the problems of finding the maximum of a multivariate polynomial...
Stability in possibilistic quadratic programming
Stability in possibilistic quadratic programming
1996,
The authors show that possibilistic quadratic programs with crisp decision variables...
A model comparison for optimal Mars ascent trajectories
A model comparison for optimal Mars ascent trajectories
1996,
Maximum payload Mars launch trajectories are computed for a nominal two-state Mars...
Group DEA for building consensus by DMU efficiency evaluation
Group DEA for building consensus by DMU efficiency evaluation
1996,
This paper proposes a new method for building group consensus, focusing on evaluating...
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
1995,
The Task Assignment Problem (TAP) arises in distributed computing environments and is...
Lower bounds for the quadratic assignment problem via triangle decompositions
Lower bounds for the quadratic assignment problem via triangle decompositions
1995,
The authors consider transformations of the (metric) Quadratic Assignment Problem...
Simulated annealing for the QAP-Optimal tradeoff between simulation time and solution quality
Simulated annealing for the QAP-Optimal tradeoff between simulation time and solution quality
1993,
This paper reports on the optimization of solution quality for a Simulated Annealing...
Solving the inverse problem for measures using iterated function systems: A new approach
Solving the inverse problem for measures using iterated function systems: A new approach
1995,
The authors present a systematic method of approximating, to an arbitrary accuracy, a...
Solving the generalized machine assignment problem in group technology
Solving the generalized machine assignment problem in group technology
1996,
Many existing solution methodologies for machine assignment problems in group...
A modified simplex approach for solving bilevel linear programming problems
A modified simplex approach for solving bilevel linear programming problems
1993,
A method for solving bilevel linear programming problems is proposed. The inner...
A heuristic algorithm for a portfolio optimization model applied to the Milan stock market
A heuristic algorithm for a portfolio optimization model applied to the Milan stock market
1996,
In this paper the authors present a model which takes into account characteristics of...
Optimal timing of reviews in concurrent design for manufacturability
Optimal timing of reviews in concurrent design for manufacturability
1995,
Concurrent design can reduce the time required to develop new products and redesign...
Papers per page: