Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: heuristics
Found
5460 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Cutting Plane Algorithms and Approximate Lower Subdifferentiability
2011,
Penot Jean-Paul
A notion of boundedly ϵ ‐lower subdifferentiable functions is introduced...
Generic Stability and Essential Components of Generalized KKM Points and Applications
2011,
Khanh Q
We propose the definition of T ‐KKM points and consider generic stability of T...
Approximate Greatest Descent Methods for Optimization with Equality Constraints
2011,
Goh S
In an optimization problem with equality constraints the optimal value function...
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
2011,
Herskovits Jos
Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems...
Strong Convergence of an Iterative Scheme by a New Type of Projection Method for a Family of Quasinonexpansive Mappings
2011,
Kimura Y
We deal with a common fixed point problem for a family of quasinonexpansive mappings...
Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set
2011,
Hu Hui
This article presents new conditions that ensure the closedness of a convex cone in...
Maximal Monotone Operators and the Proximal Point Algorithm in the Presence of Computational Errors
2011,
Zaslavski J
In a finite‐dimensional Euclidean space, we study the convergence of a proximal...
Performance Analysis for Controlled Semi‐Markov Systems with Application to Maintenance
2011,
Guo Xianping
This paper concerns with the performance analysis for controlled semi‐Markov...
A beam search heuristics to solve the parcel hub scheduling problem
2012,
McWilliams Douglas L
In this paper, a beam search scheduling heuristic (BSSH) is presented to solve the...
An improved linearization technique for a class of quadratic 0‐1 programming problems
2012,
Chen Anthony
The recent research on linearization techniques for solving 0‐1 quadratic...
Single‐machine scheduling with nonlinear deterioration
2012,
Wang Ji-Bo
In this paper, we consider the single‐machine scheduling problems with...
Branching on nonchimerical fractionalities
2012,
Fischetti Matteo
We address methods for selecting the branching variable in an enumerative algorithm...
Representing quadratically constrained quadratic programs as generalized copositive programs
2012,
Burer Samuel
We show that any (nonconvex) quadratically constrained quadratic program (QCQP) can be...
Unconstrained formulation of standard quadratic optimization problems
2012,
Grippo Luigi
A standard quadratic optimization problem (StQP) consists of finding the largest or...
A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
2012,
Laporte Gilbert
This paper describes a generalized variable neighborhood search heuristic for the...
IPM based sparse LP solver on a heterogeneous processor
2012,
Eleyat Mujahed
We present the parallelization of a linear programming solver using a...
Bounding, filtering and diversification in CP‐based local branching
2012,
Lodi Andrea
Local branching is a general purpose heuristic method which searches locally around...
One hyper‐heuristic approach to two timetabling problems in health care
2012,
Vanden Berghe Greet
We present one general high‐level hyper‐heuristic approach for...
Experimental analysis of heuristics for the bottleneck traveling salesman problem
2012,
LaRusic John
In this paper we develop efficient heuristic algorithms to solve the bottleneck...
Simple heuristics for the assembly line worker assignment and balancing problem
2012,
Ritt Marcus
We propose simple heuristics for the assembly line worker assignment and balancing...
Combined mathematical programming and heuristics for a radiotherapy pre‐treatment scheduling problem
2012,
Petrovic Sanja
Demand for radiotherapy treatment services has increased due to higher cancer...
Property Testing on k‐Vertex‐Connectivity of Graphs
2012,
Ito Hiro
We present an algorithm for testing the k ‐vertex‐connectivity of graphs...
A Linear‐Time Algorithm for Star‐Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
2012,
Nagamochi Hiroshi
A star‐shaped drawing of a graph is a straight‐line drawing such that...
Regularization Proximal Point Algorithm for Common Fixed Points of Nonexpansive Mappings in Banach Spaces
2012,
Tuyen Truong
We study the strong convergence of a regularization proximal point algorithm for the...
First Page
63
64
65
66
67
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers