Journal: Computational Optimization and Applications

Found 579 papers in total
A bundle-type algorithm for routing in telecommunication data networks
A bundle-type algorithm for routing in telecommunication data networks
2009,
To optimize the quality of service through a telecommunication network, we propose an...
Hybrid heuristics for the maximum diversity problem
Hybrid heuristics for the maximum diversity problem
2009,
The maximum diversity problem presents a challenge to solution methods based on...
A successive SDP-NSDP approach to a robust optimization problem in finance
A successive SDP-NSDP approach to a robust optimization problem in finance
2009,
The robustification of trading strategies is of particular interest in financial...
New facets for the two-stage uncapacitated facility location polytope
New facets for the two-stage uncapacitated facility location polytope
2009,
The two-stage uncapacitated facility location problem is considered. This problem...
A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
2009,
In this paper, a general algorithm for solving Generalized Geometric Programming with...
On solving the Lagrangian dual of integer programs via an incremental approach
On solving the Lagrangian dual of integer programs via an incremental approach
2009,
The Lagrangian dual of an integer program can be formulated as a min-max problem where...
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
2009,
The purpose of the traffic assignment problem is to obtain a traffic flow pattern...
A stable primal–dual approach for linear programming under nondegeneracy assumptions
A stable primal–dual approach for linear programming under nondegeneracy assumptions
2009,
This paper studies a primal–dual interior/exterior-point path-following approach...
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
2009,
We introduce a new network simplex pivot rule for the shortest path simplex algorithm....
Towards auction algorithms for large dense assignment problems
Towards auction algorithms for large dense assignment problems
2009,
In this paper, we focus on the problem of solving large-scale instances of the linear...
An inexact-restoration method for nonlinear bilevel programming problems
An inexact-restoration method for nonlinear bilevel programming problems
2009,
We present a new algorithm for solving bilevel programming problems without...
Optimal purchasing cycle length of a deteriorating product for intermediary firms
Optimal purchasing cycle length of a deteriorating product for intermediary firms
2009,
In a supply chain logistics system, the function of an intermediary firm is to...
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
2009,
In this paper, we propose approximate and exact algorithms for the double constrained...
Local models – An approach to distributed multi-objective optimization
Local models – An approach to distributed multi-objective optimization
2009,
When solving real-world optimization problems, evolutionary algorithms often require a...
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
2009,
The nonlinear knapsack problem, which has been widely studied in the OR literature, is...
Reconstructing (0,1)-matrices from projections using integer programming
Reconstructing (0,1)-matrices from projections using integer programming
2009,
We study the problem of reconstructing (0,1)–matrices based on projections along...
Local models– an approach to distributed multi-objective optimization
Local models– an approach to distributed multi-objective optimization
2009,
When solving real–world optimization problems, evolutionary algorithms often...
Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
2008,
Hub and spoke type networks are often designed to solve problems that require the...
Local analysis of the feasible primal–dual interior-point method
Local analysis of the feasible primal–dual interior-point method
2008,
In this paper we analyze the rate of local convergence of the Newton primal–dual...
Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation
Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation
2008,
During the last fifteen years the dual simplex method has become a strong contender in...
Implementation of warm‐start strategies in interior-point methods for linear programming in fixed dimension
Implementation of warm‐start strategies in interior-point methods for linear programming in fixed dimension
2008,
We implement several warm–start strategies in interior–point methods for...
A new trust region method with adaptive radius
A new trust region method with adaptive radius
2008,
In this paper we develop a new trust region method with adaptive radius for...
A recursive algorithm for constrained two-dimensional cutting problems
A recursive algorithm for constrained two-dimensional cutting problems
2008,
This paper presents a recursive algorithm for constrained two–dimensional...
A global continuation algorithm for solving binary quadratic programming problems
A global continuation algorithm for solving binary quadratic programming problems
2008,
In this paper, we propose a new continuous approach for the unconstrained binary...
Papers per page: