Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
Depth First Search (DFS) tree is a fundamental data structure for graphs used in...
Evasion of a moving object from detection by a system of observers: Sensor‐maneuvering search means
Consideration was given to planning the optimal evasion trajectory of a moving object...
Some modified Yabe‐Takano conjugate gradient methods with sufficient descent condition
Dong Xiao Liang
Descent condition is a crucial factor to establish the global convergence of nonlinear...
A Robust Optimization Approach for Magnetic Spacecraft Attitude Stabilization
Attitude stabilization of spacecraft using magnetorquers can be achieved by a...
A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
In this paper, we consider a global optimization problem for a symmetric Lipschitz...
Equity based congestion pricing: considering the constraint of alternative path
Congestion pricing is considered as an effective measure to ease urban traffic...
Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
The coupled lot‐sizing and cutting‐stock problem has been a challenging...
A column generation approach for the route planning problem in fourth party logistics
In this paper, we address the route planning problem in fourth party logistics (4PL)....
A hybrid search approach in production-distribution planning problem in supply chain using multi-agent systems
Zarandi Mohammad Hossein Fazel
The production‐distribution planning is one of the most important approaches to...
Navigation in multiobjective optimization methods
Building on previous work of the authors, this paper formally defines and reviews the...
A quartet method based on variable neighborhood search for biomedical literature extraction and clustering
Medline/PubMed is the largest reference database collecting, organizing, and analyzing...
A partitioning algorithm for the mixed integer nonlinear programming problem
An interval partitioning method (IPM) is proposed to solve the...
A simulated-based genetic algorithm for the forecasting of monthly peak electricity demand
Adam NoureRoukayya Badurally
This paper is focused on the forecast of the monthly peak electricity demand using...
Restricted swap-based neighborhood search for the minimum connected dominating set problem
The minimum connected dominating set problem (MCDSP) has become increasingly important...
Simultaneous or Sequential? Search Strategies in the U.S. Auto Insurance Industry
We study the identification of the search method consumers use when resolving...
Zooming In on Choice: How Do Consumers Search for Cameras Online?
Bronnenberg Bart J
We describe online consumers’ search behavior for differentiated durable goods...
Attribution Strategies and Return on Keyword Investment in Paid Search Advertising
Firms use different attribution strategies such as last‐click or...
Search for Information on Multiple Products
Shen Zuo-Jun Max
We develop a framework for continuous search for information on a choice set of...
A series of single array 2m factorial search designs for even m
By means of a search design one is able to search for and estimate a small set of...
Search Before Trade-offs Are Known
Search, broadly defined, is a critical managerial activity. Our contribution is a...
Insurance, Consumer Search, and Equilibrium Price Distributions
Platt Brennan C
We examine a service market with two frictions: search is required to obtain price...
Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
In this paper we consider bound constrained global optimization problems where...
Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints
The derivative‐free global optimization algorithms developed in Part I of this...
A short note on locating facilities on a path to minimize load range equity measure
This work considers the problem of locating p facilities on the nodes of a path such...
Papers per page: