Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Journal of Global Optimization
Found
560 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On 2‐stage robust LP with RHS uncertainty: complexity results and applications
2011,
Minoux Michel
We investigate here the class–denoted R‐LP‐RHSU–of...
A particle swarm optimization‐based hybrid algorithm for minimum concave cost network flow problems
2011,
Yan Shangyao
Traditionally, minimum cost transshipment problems have been simplified as linear cost...
Using the idea of expanded core for the exact solution of bi‐objective multi‐dimensional knapsack problems
2011,
Mavrotas George
We propose a methodology for obtaining the exact Pareto set of Bi‐Objective...
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
2011,
Mehrotra Sanjay
We present branching‐on‐hyperplane methods for solving mixed integer...
Self‐adaptive randomized and rank‐based differential evolution for multimodal problems
2011,
Urfalioglu Onay
Differential Evolution (DE) is a widely used successful evolutionary algorithm (EA)...
Existence results for proper efficient solutions of vector equilibrium problems and applications
2011,
Capata Adela
In this paper, we present sufficient conditions for the existence of Henig efficient...
Calmness of efficient solution maps in parametric vector optimization
2011,
Chuong D
The paper is concerned with the stability theory of the efficient solution map of a...
Generalized equilibrium problems and fixed point problems for nonexpansive semigroups in Hilbert spaces
2011,
Kamraksa Uthai
In this paper, we introduce two iterative schemes (one implicit and one explicit) for...
Low order‐value approach for solving VaR‐constrained optimization problems
2011,
Birgin G
In Low Order‐Value Optimization (LOVO) problems the sum of the r smallest...
Generalized McCormick relaxations
2011,
Scott K
Convex and concave relaxations are used extensively in global optimization algorithms....
Markov modelling and parameterisation of genetic evolutionary test generations
2011,
Cheng Adriel
Genetic evolutionary algorithms are effective and optimal test generation methods....
A Smoothing Newton Method for Semi‐Infinite Programming
2004,
Qi Liqun
This paper is concerned with numerical methods for solving a semi‐infinite...
Second‐Order Global Optimality Conditions for Optimization Problems
2004,
Yang Q
Second‐order optimality conditions are studied for the constrained optimization...
Equilibrium Problems under Generalized Convexity and Generalized Monotonicity
2004,
Schaible Siegfried
Generalized convex functions preserve many valuable properties of mathematical...
On the Convergence of a Population‐Based Global Optimization Algorithm
2004,
Fang Shu-Cherng
In global optimization, a typical population‐based stochastic search method...
Smooth Convex Approximation to the Maximum Eigenvalue Function
2004,
Qi Liqun
In this paper, we consider smooth convex approximations to the maximum eigenvalue...
Duality theorems and algorithms for linear programming in measure spaces
2004,
Wen C F
The purpose of this paper is to present some results on linear programming in measure...
Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization
2004,
Tseng Paul
We study convergence properties of Dikin's affine scaling algorithm applied to...
An Approximation Approach to Non‐strictly Convex Quadratic Semi‐infinite Programming
2004,
Ito S
We present in this paper a numerical method for solving...
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
2011,
Arounassalame M
We propose an algorithm for constrained global optimization to tackle...
Identifying preferred solutions to Multi‐Objective Binary Optimisation problems, with an application to the Multi‐Objective Knapsack Problem
2011,
Morton Alec
In this paper we present a new framework for identifying preferred solutions to...
Using the Dinkelbach‐type algorithm to solve the continuous‐time linear fractional programming problems
2011,
Wu Hsien-Chung
A Dinkelbach‐type algorithm is proposed in this paper to solve a class of...
Characterizing strict efficiency for convex multiobjective programming problems
2011,
Bhatia Davinder
The article pertains to characterize strict local efficient solution (s.l.e.s.) of...
A logarithmic‐quadratic proximal point scalarization method for multiobjective programming
2011,
Gregrio Ronaldo
We present a proximal point method to solve multiobjective programming problems based...
First Page
15
16
17
18
19
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers