Journal: Annals of Operations Research

Found 3339 papers in total
Genetic and hybrid algorithms for graph coloring
Genetic and hybrid algorithms for graph coloring
1996,
Some genetic algorithms are considered for the graph coloring problem. As is the case...
Restricted recourse strategies for bounding the expected network recourse function
Restricted recourse strategies for bounding the expected network recourse function
1996,
This paper presents bounds for the expected recourse function for stochastic programs...
Network games; adaptations to Nash-Cournot equilibrium
Network games; adaptations to Nash-Cournot equilibrium
1996,
The authors consider nonlinear flow problems involving noncooperative agents, all...
Feasibility in uncapacitated networks: The effect of individual arcs and nodes
Feasibility in uncapacitated networks: The effect of individual arcs and nodes
1996,
The purpose of this paper is to investigate the effect of individual arcs and nodes on...
Problem space local search for number partitioning
Problem space local search for number partitioning
1996,
The authors show how simple and effective metaheuristics can be developed for the...
Metaheuristics: A bibliography
Metaheuristics: A bibliography
1996,
Metaheuristics are the most exciting development in approximate optimization...
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
1996,
The authors study and compare asynchronous parallelization strategies for tabu search,...
Generalized speculative computation of parallel simulated annealing
Generalized speculative computation of parallel simulated annealing
1996,
Simulated annealing is known to be highly sequential due to dependences between...
Combining simulated annealing with local search heuristics
Combining simulated annealing with local search heuristics
1996,
The authors introduce a meta-heuristic to combine simulated annealing with local...
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
1996,
In this paper the authors consider the problem of determining lower and upper bounds...
A convergence analysis for a convex version of Dikin’s algorithm
A convergence analysis for a convex version of Dikin’s algorithm
1996,
This paper is concerned with the convergence property of Dikin’s algorithm...
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
1996,
Cutting plane methods require the solution of a sequence of linear programs, where the...
An interior-point method for semi-infinite programming problems
An interior-point method for semi-infinite programming problems
1996,
This work examines the generalization of a certain interior-point method, namely the...
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
1996,
0-1 problems are often difficult to solve. Although special purpose algorithms (exact...
The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
1996,
A novel algorithm for the global optimization of functions is presented, in which a...
Diversification strategies in tabu search algorithms for the maximum clique problem
Diversification strategies in tabu search algorithms for the maximum clique problem
1996,
The purpose of this study is to develop some understanding of the benefits that can be...
Hybrid genetic algorithms for bin-packing and related problems
Hybrid genetic algorithms for bin-packing and related problems
1996,
The genetic algorithm (GA) paradigm has attracted considerable attention as a...
A family of genetic algorithms for the pallet loading problem
A family of genetic algorithms for the pallet loading problem
1996,
This paper is concerned with a family of genetic algorithms for the pallet loading...
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
1996,
The primal-dual infeasible-interior-point algorithm is knwon as one of the most...
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
1996,
This paper presents an algorithm for solving a linear program LP (to a given...
Manufacturing cell formation by state-space search
Manufacturing cell formation by state-space search
1996,
This paper addresses the problem of grouping machines in order to design cellular...
An infeasible-interior-point algorithm using projections onto a convex set
An infeasible-interior-point algorithm using projections onto a convex set
1996,
The authors present a new class of primal-dual infeasible-interior-point methods for...
A path-following interior-point algorithm for linear and quadratic problems
A path-following interior-point algorithm for linear and quadratic problems
1996,
The paper describes an algorithm for the monotone linear complementarity problem (LCP)...
A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence
A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence
1996,
Mehrotra’s predictor-corrector algorithm is currently considered to be one of...
Papers per page: