Journal: Optimization Letters

Found 309 papers in total
Optimality conditions in terms of Bouligand derivatives for Pareto efficiency in set‐valued optimization
2011,
The aim of this paper is to present optimality conditions for Pareto efficiency of...
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
2011,
We demonstrate that the linear multidimensional assignment problem with iid random...
Privacy‐preserving linear programming
2011,
We propose a privacy‐preserving formulation of a linear program whose...
Cooperative games in facility location situations with regional fixed costs
2011,
A continuous single‐facility location problem, where the fixed cost (or...
A note on two‐machine no‐wait flow shop scheduling with deteriorating jobs and machine availability constraints
2011,
This paper is concerned with two‐machine no‐wait flow shop scheduling...
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
2011,
In this paper we present a methodology for finding tight convex relaxations for a...
A short proof on the cardinality of maximal positive bases
2011,
A positive basis is a minimal set of vectors whose nonnegative linear combinations...
N‐fold integer programming and nonlinear multi‐transshipment
2011,
The multi‐transshipment problem is NP‐hard already for two commodities...
Modelling banking sector stability with multicriteria approaches
2010,
Banking crises can be damaging for the economy, and as the recent experience has...
Uniqueness of integer solution of linear equations
2010,
We consider the system of m linear equations in n integer variables Ax = d and give...
A biased random-key genetic algorithm for road congestion minimization
2010,
One of the main goals in transportation planning is to achieve solutions for two...
Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming
2010,
In this paper, we present simple proofs for the main results that appear in Nunez...
A note on Burer's copositive representation of mixed-binary QPs
2010,
In an important paper, Burer (2009) recently showed how to reformulate general...
The economic lot scheduling problem under extended basic period and power-of-two policy
2010,
The economic lot scheduling problem schedules the production of several different...
An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
2010,
This paper deals with a two-machine open shop scheduling problem. The objective is to...
An integrated FDM–ANP evaluation model for sustainable development of housing community
2010,
When sustainable development becomes the global trend on residential environment, the...
A combined direction stochastic approximation algorithm
2010,
The stochastic approximation problem is to find some root or minimum of a nonlinear...
Optimal mortgage loan securitization and the subprime crisis
2009,
We analyze the process of mortgage loan securitization that has been a root cause of...
A fast heuristic algorithm for the maximum concurrent k-splittable flow problem
2009,
In this paper, we propose a fast heuristic algorithm for the maximum concurrent...
The approximability of three-dimensional assignment problems with bottleneck objective
2009,
We discuss two special cases of the three-dimensional bottleneck assignment problem...
Dynamic shortest path problems with time-varying costs
2009,
This paper concerns the problem of finding shortest paths from one node to all other...
A simple greedy algorithm for a class of shuttle transportation problems
2009,
Greedy algorithms for combinatorial optimization problems are typically direct and...
Bounds for a constrained optimal stopping problem
2009,
In this short letter, we present an explicit upper bound for the optimal value of a...
A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
2009,
We are concerned with the exact solution of a graph optimization problem known as...
Papers per page: