Suchergebnisse - "Suboptimal algorithms"

Dynamic Conflict-Prediction Based Algorithm for Multi-agent Path Finding von ZHANG Mengxi, HAN Jianjun, XIAO Yan

“… Multi-agent path finding(MAPF) is the problem of searching for collision-free paths for a group of agents.Currently,flexible explicit estimation conflict-based …”
Volltext

Toward Robust Revenue Management: Competitive Analysis of Online Booking von Ball, Michael O, Queyranne, Maurice

“… In this paper, we consider the revenue management problem from the perspective of online algorithms. This approach eliminates the need for both demand …”
Volltext

The Assortment Packing Problem: Multiperiod Assortment Planning for Short-Lived Products von Caro, Felipe, Martínez-de-Albéniz, Victor, Rusmevichientong, Paat

“… Motivated by retailers' frequent introduction of new items to refresh product lines and maintain their market shares, we present the assortment packing problem …”
Volltext

Quadrature spatial media-based modulation with RF mirrors von Pillay, Narushan, Xu, HongJun

“… The use of radio frequency (RF) mirrors to improve spectral efficiency is a recently introduced technique. The authors investigate its application to single RF …”
Volltext

Beam-ACO for Simple Assembly Line Balancing von Blum, Christian

“… Assembly line balancing problems are concerned with the optimization of manufacturing processes. In this paper we consider the so-called simple assembly line …”
Volltext

Guided Local Search for the Three-Dimensional Bin-Packing Problem von Faroe, Oluf, Pisinger, David, Zachariasen, Martin

“… The three-dimensional bin-packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper …”
Volltext

Improved Bounds for the Symmetric Rendezvous Value on the Line von Han, Qiaoming, Du, Donglei, Vera, Juan, Zuluaga, Luis F

“… A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the …”
Volltext

An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search von Dauzère-Pérès, Stéphane, Paulli, Jan

Volltext

Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures von Hall, Nicholas G, Posner, Marc E

“… The operations research literature contains numerous studies on the design and application of optimization and heuristic solution procedures. These studies …”
Volltext

Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem von Birattari, Mauro, Balaprakash, Prasanna, Stutzle, Thomas, Dorigo, Marco

“… In recent years, much attention has been devoted to the development of metaheuristics and local search algorithms for tackling stochastic combinatorial …”
Volltext

A suboptimal algorithm for de novo peptide sequencing via tandem mass spectrometry von Lu, Bingwen, Chen, Ting

“… Tandem mass spectrometry has emerged to be one of the most powerful high-throughput techniques for protein identification. Tandem mass spectrometry selects and …”
Weitere Angaben

Job Shop Scheduling by Simulated Annealing von van Laarhoven, Peter J. M, Aarts, Emile H. L, Lenstra, Jan Karel

“… We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a …”
Volltext

Maximum Commonality Problems: Applications and Analysis von Dawande, Milind, Kumar, Subodha, Mookerjee, Vijay, Sriskandarajah, Chelliah

“… Recently, an agile software development technique called extreme programming has caught the attention of practitioners and researchers in the software …”
Volltext

A Location Based Heuristic for General Routing Problems von Bramel, Julien, Simchi-Levi, David

“… We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator …”
Volltext

A fully polynomial approximation scheme for the weighted earliness-tardiness problem von Kovalyov, Mikhail Y, Kubiak, Wieslaw

“… A fully polynomial approximation scheme for the problem of scheduling n jobs on a single machine to minimize total weighted earliness and tardiness is …”
Volltext

Improved Algorithms for Economic Lot Size Problems von Aggarwal, Alok, Park, James K

“… Many problems in inventory control, production planning, and capacity planning can be formulated in terms of a simple economic lot size model proposed …”
Volltext

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops von Glass, C.A, Potts, C.N, Strusevich, V.A

“… In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in …”
Volltext

Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems von Vaughan, Diane E, Jacobson, Sheldon H, Hall, Shane N, McLay, Laura A

“… This paper introduces simultaneous generalized hill-climbing (SGHC) algorithms as a framework for simultaneously addressing a set of related discrete …”
Volltext

A 1.47-approximation algorithm for a preemptive single-machine scheduling problem von Goemans, Michel X., Wein, Joel M., Williamson, David P.

“… In this note, we give a 1.47-approximation algorithm for the preemptive scheduling of jobs with release dates on a single machine so as to minimize the …”
Volltext

A [formula omitted]-approximation algorithm for the clustered traveling salesman tour and path problems von Anily, Shoshana, Bramel, Julien, Hertz, Alain

“… We consider the ordered cluster traveling salesman problem (OCTSP). In this problem, a vehicle starting and ending at a given depot must visit a set of n …”
Volltext