Journal: Optimization Letters

Found 309 papers in total
Discretization orders for distance geometry problems
Discretization orders for distance geometry problems
2012,
Given a weighted, undirected simple graph G = ( V , E , d ) (where d : E → ℝ...
Optimization framework for process scheduling of operation‐dependent automobile assembly lines
Optimization framework for process scheduling of operation‐dependent automobile assembly lines
2012,
Productivity, cost, and completion time are regarded as performance measures for...
Complexity and approximation of an area packing problem
Complexity and approximation of an area packing problem
2012,
Motivated by an application in mobile telecommunication systems, we investigate a...
A converse duality theorem on higher‐order dual models in nondifferentiable mathematical programming
A converse duality theorem on higher‐order dual models in nondifferentiable mathematical programming
2012,
We consider in this paper Mond–Weir type higher‐order dual models in...
Higher order duality in vector optimization over cones
Higher order duality in vector optimization over cones
2012,
In this paper higher order cone convex, pseudo convex, strongly pseudo convex, and...
An improved linearization technique for a class of quadratic 0‐1 programming problems
An improved linearization technique for a class of quadratic 0‐1 programming problems
2012,
The recent research on linearization techniques for solving 0‐1 quadratic...
On the optimality of some classes of invex problems
On the optimality of some classes of invex problems
2012,
In this paper we define two notions: Kuhn–Tucker saddle point invex problem with...
A cooperative differential game model based on network throughput and energy efficiency in wireless networks
A cooperative differential game model based on network throughput and energy efficiency in wireless networks
2012,
Network throughout and energy efficiency are of paramount importance for network...
Approximation algorithms for multiple terminal, Hamiltonian path problems
Approximation algorithms for multiple terminal, Hamiltonian path problems
2012,
This article presents a new 2‐approximation algorithm for a multiple depot,...
Single‐machine scheduling with nonlinear deterioration
Single‐machine scheduling with nonlinear deterioration
2012,
In this paper, we consider the single‐machine scheduling problems with...
Copulas with maximum entropy
Copulas with maximum entropy
2012,
We shall find a multi‐dimensional checkerboard copula of maximum entropy that...
Higher‐level RLT or disjunctive cuts based on a partial enumeration strategy for 0‐1 mixed‐integer programs
Higher‐level RLT or disjunctive cuts based on a partial enumeration strategy for 0‐1 mixed‐integer programs
2012,
In this paper, we consider the generation of disjunctive cuts for 0‐1...
3‐Approximation algorithm for a two depot, heterogeneous traveling salesman problem
3‐Approximation algorithm for a two depot, heterogeneous traveling salesman problem
2012,
We present the first approximation algorithm for a two depot, heterogeneous traveling...
The same growth of FB and NR symmetric cone complementarity functions
The same growth of FB and NR symmetric cone complementarity functions
2012,
We establish that the Fischer–Burmeister (FB) complementarity function and the...
Complexity analysis and optimization of the shortest path tour problem
Complexity analysis and optimization of the shortest path tour problem
2012,
The shortest path tour problem (SPTP) consists in finding a shortest path from a given...
A continuous approach to combinatorial optimization: application of water system pump operations
A continuous approach to combinatorial optimization: application of water system pump operations
2012,
In this paper, we have suggested a penalty method to modify the combinatorial...
Classical linear vector optimization duality revisited
Classical linear vector optimization duality revisited
2012,
With this note we bring again into attention a vector dual problem neglected by the...
New weighing matrices constructed from two circulant submatrices
New weighing matrices constructed from two circulant submatrices
2012,
A number of new weighing matrices constructed from two circulants and via a direct sum...
Designing a new computational approach of partial backlogging on the economic production quantity model for deteriorating items with non‐linear holding cost under inflationary conditions
Designing a new computational approach of partial backlogging on the economic production quantity model for deteriorating items with non‐linear holding cost under inflationary conditions
2011,
This paper discusses the production inventory model over an infinite time horizon....
On the computation of all solutions of jointly convex generalized Nash equilibrium problems
On the computation of all solutions of jointly convex generalized Nash equilibrium problems
2011,
Jointly convex generalized Nash equilibrium problems are the most studied class of...
A sliding time window heuristic for open pit mine block sequencing
A sliding time window heuristic for open pit mine block sequencing
2011,
The open pit mine block sequencing problem (OPBS) seeks a discretetime production...
Recoverable robust knapsacks: the discrete scenario case
Recoverable robust knapsacks: the discrete scenario case
2011,
The knapsack problem is one of the basic problems in combinatorial optimization. In...
An exact algorithm for side‐chain placement in protein design
An exact algorithm for side‐chain placement in protein design
2011,
Computational protein design aims at constructing novel or improved functions on the...
Experiments with LAGRASP heuristic for set k‐covering
Experiments with LAGRASP heuristic for set k‐covering
2011,
The set k ‐covering problem (SC k P) is a variant of the classical set covering...
Papers per page: