Journal: Journal of Global Optimization

Found 560 papers in total
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
2009,
We consider relaxations for nonconvex quadratically constrained quadratic programming...
Global solution of bilevel programs with a nonconvex inner program
Global solution of bilevel programs with a nonconvex inner program
2008,
A bounding algorithm for the global solution of nonlinear bilevel programs involving...
Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning
Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning
2008,
The intensity modulated radiation therapy (IMRT) treatment planning problem consists...
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem
2008,
We examine a routing problem in which network arcs fail according to independent...
A note on global optimization via the heat diffusion equation
A note on global optimization via the heat diffusion equation
2008,
We consider the interesting smoothing method of global optimization recently proposed...
Comments on an ancient Greek racecourse: finding minimum width annuluses
Comments on an ancient Greek racecourse: finding minimum width annuluses
2008,
For a set of measured points, we describe a linear–programming model that...
Duality for almost convex optimization problems via the perturbation approach
Duality for almost convex optimization problems via the perturbation approach
2008,
We deal with duality for almost convex finite dimensional optimization problems by...
Generalized Semi-Infinite Programming: on generic local minimizers
Generalized Semi-Infinite Programming: on generic local minimizers
2008,
In this paper a basic structural problem in Generalized Semi–Infinite...
A method for approximating pairwise comparison matrices by consistent matrices
A method for approximating pairwise comparison matrices by consistent matrices
2008,
In several methods of multiattribute decision making, pairwise comparison matrices are...
Necessary optimality conditions for bilevel set optimization problems
Necessary optimality conditions for bilevel set optimization problems
2007,
Bilevel programming problems are hierarchical optimization problems where in the upper...
New bounds on the unconstrained quadratic integer programming problem
New bounds on the unconstrained quadratic integer programming problem
2007,
We consider the maximization γ = max{x T Ax, x ∈ {−1,1} n } for a...
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
2007,
The blending problem is studied as a problem of finding cheap robust feasible...
Optimality conditions and duality for a class of non differentiable multi-objective fractional programming problems
Optimality conditions and duality for a class of non differentiable multi-objective fractional programming problems
2007,
A class of multi-objective fractional programming problems (MFP) are considered where...
Constraint qualification in a general class of Lipschitzian mathematical programming problems
Constraint qualification in a general class of Lipschitzian mathematical programming problems
2007,
The Karush–Kuhn–Tucker type necessary optimality conditions are given for...
A novel approach to bilevel nonlinear programming
A novel approach to bilevel nonlinear programming
2007,
Recently developed methods of monotonic optimization have been applied successfully...
Parametric global optimisation for bilevel programming
Parametric global optimisation for bilevel programming
2007,
We propose a global optimisation approach for the solution of various classes of...
A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
2007,
In this paper, the Vehicle Routing Problem (VRP) is formulated as a problem of two...
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
2007,
This paper presents two linear cutting plane algorithms that refine existing methods...
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
2007,
In many discrete location problems, a given number s of facility locations must be...
Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories
Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories
2007,
We introduce and describe the Multiple Gravity Assist problem, a global optimisation...
Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
2007,
This paper proposes a system optimal dynamic traffic assignment model that does not...
A hybrid method for solving multi-objective global optimization problems
A hybrid method for solving multi-objective global optimization problems
2007,
Real optimization problems often involve not one, but multiple objectives, usually in...
Nonlinear optimization with GAMS/LGO
Nonlinear optimization with GAMS/LGO
2007,
The Lipschitz Global Optimizer (LGO) software integrates global and local scope search...
Survivable network design under optimal and heuristic interdiction scenarios
Survivable network design under optimal and heuristic interdiction scenarios
2007,
We examine the problem of building or fortifying a network to defend against enemy...
Papers per page: