Keyword: heuristics

Found 5460 papers in total
Computing Laser Beam Paths in Optical Cavities: An Approach Based on Geometric Newton Method
Computing Laser Beam Paths in Optical Cavities: An Approach Based on Geometric Newton Method
2016,
In the last decade, increasing attention has been drawn to high‐precision...
Approximate Karush‐Kuhn‐Tucker Condition in Multiobjective Optimization
Approximate Karush‐Kuhn‐Tucker Condition in Multiobjective Optimization
2016,
We extend the so‐called approximate Karush–Kuhn–Tucker condition...
Generalized Derivatives of Differential‐Algebraic Equations
Generalized Derivatives of Differential‐Algebraic Equations
2016,
Nonsmooth equation‐solving and optimization algorithms which require local...
New Augmented Lagrangian-Based Proximal Point Algorithm for Convex Optimization with Equality Constraints
New Augmented Lagrangian-Based Proximal Point Algorithm for Convex Optimization with Equality Constraints
2016,
The augmented Lagrangian method is a classic and efficient method for solving...
Dual Descent Methods as Tension Reduction Systems
Dual Descent Methods as Tension Reduction Systems
2016,
In this paper, driven by applications in Behavioral Sciences, wherein the speed of...
Second-Order Conditions for Open-Cone Minimizers and Firm Minimizers in Set-Valued Optimization Subject to Mixed Constraints
Second-Order Conditions for Open-Cone Minimizers and Firm Minimizers in Set-Valued Optimization Subject to Mixed Constraints
2016,
We consider second‐order optimality conditions for set‐valued...
Canonical duality for solving general nonconvex constrained problems
Canonical duality for solving general nonconvex constrained problems
2016,
This paper presents a canonical duality theory for solving a general nonconvex...
On optimality of two adaptive choices for the parameter of Dai‐Liao method
On optimality of two adaptive choices for the parameter of Dai‐Liao method
2016,
Orthonormal matrices are a class of well‐conditioned matrices with the least...
A Riemannian subspace limited-memory SR1 trust region method
A Riemannian subspace limited-memory SR1 trust region method
2016,
In this paper, we present a new trust region algorithm on any compact Riemannian...
A limited memory descent Perry conjugate gradient method
A limited memory descent Perry conjugate gradient method
2016,
In this work, we present a new limited memory conjugate gradient method which is based...
Weak infeasibility in second order cone programming
Weak infeasibility in second order cone programming
2016,
The objective of this work is to study weak infeasibility in second order cone...
Policy iteration for robust nonstationary Markov decision processes
Policy iteration for robust nonstationary Markov decision processes
2016,
Policy iteration is a well‐studied algorithm for solving stationary Markov...
Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator
Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator
2016,
In this paper, we consider a special variant of a capacitated dynamic lot sizing...
Quadratic scalarization for decomposed multiobjective optimization
Quadratic scalarization for decomposed multiobjective optimization
2016,
Practical applications in multidisciplinary engineering design, business management,...
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
2016,
Motivated by the flow of products in the iron and steel industry, we study an...
Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem
Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem
2016,
Energy consumption has become a key concern for manufacturing sector because of...
Creating seating plans: a practical application
Creating seating plans: a practical application
2016,
This paper examines the interesting problem of designing seating plans for large...
Synchronisation of order cycles of multiple buyers in a supply chain with trade credit policy
Synchronisation of order cycles of multiple buyers in a supply chain with trade credit policy
2016,
In this paper, we propose a coordinated single‐vendor multi‐buyer supply...
The Surgical Patient Routing Problem: A Central Planner Approach
The Surgical Patient Routing Problem: A Central Planner Approach
2016,
Many patients face difficulties when accessing medical facilities, particularly in...
Optimality of Quasi-Open-Loop Policies for Discounted Semi-Markov Decision Processes
Optimality of Quasi-Open-Loop Policies for Discounted Semi-Markov Decision Processes
2016,
Quasi‐open‐loop policies consist of sequences of Markovian decision...
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
2016,
In the Hamiltonian p ‐median problem (HpMP), the target is to find p cycles...
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
2016,
For a cost‐sharing cooperative game with an empty core, we study the problem of...
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
2016,
We propose a new exact algorithm for the two‐dimensional...
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
2016,
We propose a framework to model general guillotine restrictions in...
Papers per page: