Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: computational analysis
Found
489 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Makespan minimization in the two-machine flowshop batch scheduling problem
2000,
Cheng T.C.E.
In this paper we consider a practical scheduling problem commonly arising from batch...
Three scheduling algorithms applied to the earth observing systems domain
2000,
Wolfe William J.
This paper describes three approaches to assigning tasks to earth observing satellites...
On a primal–dual analytic center cutting plane method for variational inequalities
1999,
Goffin J.-L.
We present an algorithm for variational inequalities VI( F , Y ) that uses a...
An augmentation algorithm for the maximum weighted stable set problem
1999,
Mannino Carlo
Edge projection is a specialization of Lovász and Plummer's clique reduction...
Optimization based algorithms for finding minimal cost ring covers in survivable networks
1999,
Kennington Jeffery L.
Designing low cost SONET networks composed of self-healing rings is an important...
A shifted-barrier primal–dual algorithm model for linearly constrained optimization problems
1999,
Lucidi Stefano
In this paper we describe a Newton-type algorithm model for solving smooth constrained...
First-order algorithms for generalized semi-infinite min–max problems
1999,
Qi Liqun
We present a first-order algorithm for solving semi-infinite generalized min–max...
An optimal way of moving a sequence of points onto a curve in two dimensions
1999,
Powell M.J.D.
Let s (t), 0 ≤ t ≤ T , be a smooth curve and let x i , i = 1, 2, ..., n , be a...
On nonlinear complementarity problem functions
1999,
Qi Liqun
In this paper we reformulate several NCP-functions for the nonlinear complementarity...
Primal–dual path-following algorithms for determinant maximization problems with linear matrix inequalities
1999,
Toh Kim-Chuan
Primal–dual path-following algorithms are considered for determinant...
Hard knapsack problems that are easy for local search
1999,
Chakravarti Nilotpal
Chvátal describes a class of zero–one knapsack problems provably...
A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
1999,
Mohan C.
In this paper, a computational algorithm, named RST2ANU algorithm, has been developed...
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
1999,
Vial J.-P.
This paper addresses the issues involved with an interior point-based decomposition...
A deterministic approach to linear programs with several additional multiplicative constraints
1999,
Kuno Takahito
We consider a global optimization problem of minimizing a linear function subject to p...
Solving Euclidean distance matrix completion problems via semidefinite programming
1999,
Wolkowicz Henry
Given a partial symmetric matrix A with only certain elements specified, the Euclidean...
QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
1999,
Ralph Daniel
We describe a technique for generating a special class, called QPEC, of mathematical...
Computational study of the relationships between feasible and efficient sets and an approximation
1999,
Mateos A.
The computational difficulty of obtaining the efficient set in multi-objective...
Vector maximisation over a finite set of alternatives
1998,
Walker J.
This paper examines the computational complexity of solving the vector maximisation...
An interior-point algorithm for nonconvex nonlinear programming
1999,
Shanno David F.
The paper describes an interior-point algorithm for nonconvex nonlinear programming...
Testing parallel variable transformation
1999,
Fukushima Masao
This paper studies performance of the parallel variable transformation (PVT) algorithm...
Multicategory classification by support vector machines
1999,
Bennett Kristin P.
We examine the problem of how to discriminate between objects of three or more...
Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods
1999,
Sherali Hanif D.
Subgradient methods are popular for solving nondifferentiable optimization problems...
Short shop schedules
1997,
Hurkens C.A.J.
We consider the open shop, job shop, and flow shop scheduling problems with integral...
The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
1998,
White L.
A new algorithm is presented for carrying out large-scale unconstrained optimization...
First Page
7
8
9
10
11
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers