Journal: Computational Optimization and Applications

Found 579 papers in total
A tabu search algorithm for the quadratic assignment problem
A tabu search algorithm for the quadratic assignment problem
2005,
Tabu search approach based algorithms are among the widest applied to various...
Increasing Internet capacity using local search
Increasing Internet capacity using local search
2004,
Open Shortest Path First (OSPF) is one of the most commonly used intra-domain internet...
Computing the initial temperature of simulated annealing
Computing the initial temperature of simulated annealing
2004,
The classical version of simulated annealing is based on a cooling schedule....
A dual projective pivot algorithm for linear programming
A dual projective pivot algorithm for linear programming
2004,
Recently, a linear programming problem solver, called dual projective simplex method,...
Multi-item, multi-facility supply chain planning: models, complexities, and algorithms
Multi-item, multi-facility supply chain planning: models, complexities, and algorithms
2004,
We propose a planning model for products manufactured across multiple manufacturing...
Interior point methods for second-order cone programming and OR applications
Interior point methods for second-order cone programming and OR applications
2004,
Interior point methods (IPM) have been developed for all types of constrained...
Undominated difference of convex decompositions of quadratic functions and applications to branch-and-bound approaches
Undominated difference of convex decompositions of quadratic functions and applications to branch-and-bound approaches
2004,
In this paper we analyze difference-of-convex decompositions (d.c.d.s) for indefinite...
A post-optimality analysis algorithm for multi-objective optimization
A post-optimality analysis algorithm for multi-objective optimization
2004,
Algorithms for multi-objective optimization problems are designed to generate a single...
An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs
An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs
2004,
In this paper the dynamic lot size problem with time varying storage capacities and...
Ant colony optimisation for machine layout problems
Ant colony optimisation for machine layout problems
2004,
Flexible machine layout problems describe the dynamic arrangement of machines to...
A network improvement problem under different norms
A network improvement problem under different norms
2004,
In this paper, we first consider a network improvement problem, called...
A smoothing method for a mathematical program with P-matrix linear complementarity constraints
A smoothing method for a mathematical program with P-matrix linear complementarity constraints
2004,
We consider a mathematical program whose constraints involve P-matrix linear...
Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
2004,
Most existing interior-point methods for a linear complementarity problem (LCP)...
A non-interior path following method for convex quadratic programming problems with bound constraints
A non-interior path following method for convex quadratic programming problems with bound constraints
2004,
We propose a non-interior path following algorithm for convex quadratic programming...
An augmented Lagrangian algorithm for large scale multicommodity routing
An augmented Lagrangian algorithm for large scale multicommodity routing
2004,
The linear multicommodity network flow (MCNF) problem has many applications in the...
A general alternative procedure for solving negative degree of difficulty problems in geometric engineering
A general alternative procedure for solving negative degree of difficulty problems in geometric engineering
2004,
The degree of difficulty is an important concept in classical geometric programming...
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
2001,
In a multiperiod dynamic network flow problem, we model uncertain arc capacities using...
Continuous optimization by a variant of simulated annealing
Continuous optimization by a variant of simulated annealing
1996,
A variant of the simulated annealing algorithm, based on the generalized method of...
A comparison of two algorithms for the assignment problem
A comparison of two algorithms for the assignment problem
1995,
State-of-the-art computational results have shown that the shortest augmenting path...
Finding postal carrier walk paths in mixed graphs
Finding postal carrier walk paths in mixed graphs
1998,
The postman problem requires finding a lowest cost tour in a connected graph that...
The capacitated arc routing problem: Valid inequalities and facets
The capacitated arc routing problem: Valid inequalities and facets
1998,
In this paper we study the polyhedron associated with the Capacitated Arc Routing...
Metaheuristics for high school timetabling
Metaheuristics for high school timetabling
1998,
In this paper we present the results of an investigation of the possibilities offered...
Branch-and-price algorithms for the one-dimensional cutting stock problem
Branch-and-price algorithms for the one-dimensional cutting stock problem
1998,
We compare two branch-and-price approaches for the cutting stock problem. Each...
On the existence and convergence of the central path for convex programming and some duality results
On the existence and convergence of the central path for convex programming and some duality results
1998,
This paper gives several equivalent conditions which guarantee the existence of the...
Papers per page: