Keyword: heuristics

Found 5460 papers in total
A fuzzy DEA and knapsack formulation integrated model for project selection
2012,
Project selection has become crucial in the fields of science and engineering. This...
A hybrid simulated annealing metaheuristic algorithm for the two‐dimensional knapsack packing problem
2012,
The rectangle knapsack packing problem is to pack a number of rectangles into a larger...
A knapsack problem as a tool to solve the production planning problem in small foundries
2012,
According to recent research carried out in the foundry sector, one of the most...
Reoptimization in Lagrangian methods for the 0–1 quadratic knapsack problem
2012,
The 0–1 quadratic knapsack problem consists of maximizing a quadratic objective...
Iterative semi‐continuous relaxation heuristics for the multiple‐choice multidimensional knapsack problem
2012,
Recently several hybrid methods combining exact algorithms and heuristics have been...
An approximation algorithm for convex multi‐objective programming problems
2011,
In multi‐objective convex optimization it is necessary to compute an infinite...
Global optimization for the generalized polynomial sum of ratios problem
2011,
In this paper, a new deterministic global optimization algorithm is proposed for...
Maximum information stored in a labeled connected network with minimum edges
2011,
Given a set X, we consider the problem of finding a graph G with vertex set X and the...
A biased random‐key genetic algorithm for routing and wavelength assignment
2011,
The problem of routing and wavelength assignment in wavelength division multiplexing...
Meta‐heuristic algorithms for solving a fuzzy single‐period problem
2011,
Single‐period problem (SPP) is a classical stochastic inventory model that has...
A realization of constraint feasibility in a moving least squares response surface based approximate optimization
2011,
In the context of approximate optimization, the most extensively used tools are the...
Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
2011,
Generalized Nash equilibrium problems (GNEPs) allow, in contrast to standard Nash...
Approximating Hessians in unconstrained optimization arising from discretized problems
2011,
We consider Hessian approximation schemes for large‐scale unconstrained...
Parallel algorithms for continuous multifacility competitive location problems
2011,
We consider a continuous location problem in which a firm wants to set up two or more...
A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
2011,
Branch and Bound Algorithms based on Interval Arithmetic permit to solve exactly...
Pattern discrete and mixed Hit‐and‐Run for global optimization
2011,
We develop new Markov chain Monte Carlo samplers for neighborhood generation in global...
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
2011,
We propose in this paper a general D.C. decomposition scheme for constructing SDP...
Min‐max and robust polynomial optimization
2011,
We consider the robust (or min‐max) optimization problem J * ≔max y...
Multitime dynamic programming for multiple integral actions
2011,
This paper introduces a new type of dynamic programming PDE for optimal control...
A comparison study of fuzzy MADM methods in nuclear safeguards evaluation
2011,
Nuclear safeguards evaluation (NSE) is to verify that a State is living up to its...
Self‐adaptive randomized and rank‐based differential evolution for multimodal problems
2011,
Differential Evolution (DE) is a widely used successful evolutionary algorithm (EA)...
Calmness of efficient solution maps in parametric vector optimization
2011,
The paper is concerned with the stability theory of the efficient solution map of a...
Papers per page: