Journal: Optimization Letters
Sufficient efficiency criteria in multiobjective fractional programming with generalized (ℱ,φ,ρ,θ)-univex n-set functions
We consider some types of generalized convexity and discuss new global semiparametric...
A general variable neighborhood search variants for the travelling salesman problem with draft limits
In this paper, we present two general variable neighborhood search (GVNS) based...
Symmetry properties of resolving sets and metric bases in hypercubes
In this paper we consider some special characteristics of distances between vertices...
General Variable Neighborhood Search for computing graph separators
Computing graph separators in networks has a wide range of real‐world...
New MIP model for multiprocessor scheduling problem with communication delays
In this paper we consider scheduling tasks on a multiprocessor system, taking into...
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem
The p ‐hub median problem consists of choosing p hub locations from a set of...
Solving the clique partitioning problem as a maximally diverse grouping problem
In this paper we show that the clique partitioning problem can be reformulated in an...
A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints
This paper considers the well‐known static time‐continuous multiproduct...
A metaheuristic approach to the dominating tree problem
This paper considers a recently introduced NP‐hard problem on graphs, called...
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
In this study, we start from a multi‐source variant of the two‐stage...
An approximation algorithm for the nth power metric facility location problem with linear penalties
We consider the n th power metric facility location problem with linear penalties (M n...
Real options approach to explore the effect of organizational change on IoT development project
The emerging information technology of internet of things (IoT) has caught much...
Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
Robust chance‐constrained Support Vector Machines (SVM) with...
ARGONAUT: AlgoRithms for Global Optimization of coNstrAined grey-box compUTational problems
The algorithmic framework ARGONAUT is presented for the global optimization of general...
Constraint relaxation, cost-sensitive learning and bagging for imbalanced classification problems with outliers
Supervised learning consists in developing models able to distinguish data that belong...
Locating facilities in a competitive environment
The research work dealing with the bi‐level formulation of location problems is...
A nonmonotone inexact Newton method for unconstrained optimization
It is well known that the Newton method has a second order rate of convergence and...
Linear transformation based solution methods for non-convex mixed integer quadratic programs
Two preprocessing techniques for mixed integer quadratic programs with...
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
We consider the online scheduling of equal‐length jobs with incompatible...
A comparison of routing sets for robust network design
Designing a network able to route a set of non‐simultaneous demand vectors is...
A note on the trace quotient problem
The trace quotient problem or the trace ratio problem (TRP) is to find an orthogonal...
Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse
In order to derive continuity and stability of two‐stage stochastic programs...
Gap functions and error bounds for generalized vector variational inequalities
This paper deals with generalized vector variational inequalities. Without any...
A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm
The Mesh Adaptive Direct Search algorithm ( Mads ) algorithm is designed for nonsmooth...
Papers per page: