Výsledky vyhľadávania - "exact algorithm"

An exact algorithm for the reliability redundancy allocation problem Autor Caserta, Marco, Voß, Stefan

“…•New exact algorithm for the redundancy allocation problem.•Applying a two-step problem transformation to the multiple choice knapsack problem…”
Získať plný text

An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation Autor Ríos-Mercado, Roger Z., Bard, Jonathan F.

“… a dispersion function subject to a set of planning requirements. Starting with the traditional mixed-integer programming model, a covering-type model…”
Získať plný text

An exact algorithm for minimizing resource availability costs in project scheduling Autor Rodrigues, Sávio B., Yamashita, Denise S.

“…A new exact algorithm that solves the Resource Availability Cost Problem (RACP) in project scheduling is shown to yield a significant improvement over the existing algorithm in the literature…”
Získať plný text

An exact algorithm for large knapsack sharing problems Autor Laalaoui, Yacine, Mhalla, Hedi

“… In this article, we describe a new Dichotomous-based exact algorithm, called Sharknap, to solve large knapsack sharing problems…”
Získať plný text

An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices Autor Hà, Minh Hoàng, Bostel, Nathalie, Langevin, André, Rousseau, Louis-Martin

“…) involves finding a minimum-length set of vehicle routes passing through a subset of vertices, subject to constraints on the length of each route and the number of vertices that it contains…”
Získať plný text

An exact algorithm for a resource allocation problem in mobile wireless communications Autor Letchford, Adam N., Ni, Qiang, Zhong, Zhaoyu

“… The goal is to allocate the available channels and power in a so-called OFDMA system , in order to maximise the transmission rate, subject to quality of service constraints…”
Získať plný text

An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation Autor Baldacci, R, Hadjiconstantinou, E, Mingozzi, A

“…The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints…”
Získať plný text

An exact algorithm for a cross-docking supply chain network design problem Autor Sung, C S, Yang, W

“…This paper proposes a branch-and-price algorithm as an exact algorithm for the cross-docking supply chain network design problem introduced by one of the authors of this paper…”
Získať plný text

A cut-and-solve algorithm for virtual machine consolidation problem Autor Luo, Jiang-Yao, Chen, Liang, Chen, Wei-Kun, Yuan, Jian-Hua, Dai, Yu-Hong

“… servers such that the summation of activated, allocation, and migration costs is minimized subject to the resource constraints of the servers and other practical constraints…”
Získať plný text

Mathematical Logic and Its Applications 2020

“…The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles)…”
Získať plný text

Mathematical Modeling and Intelligent Optimization in Green Manufacturing & Logistics

“…To address the increasingly prominent environmental pollution and energy shortage, many countries devote themselves to green manufacturing and logistics in…”
Získať plný text

An exact algorithm for linear optimization problem subject to max-product fuzzy relational inequalities with fuzzy constraints Autor Amin Ghodousian, Omidi, Romina

“…Fuzzy relational inequalities with fuzzy constraints (FRI-FC) are the generalized form of fuzzy relational inequalities (FRI) in which fuzzy inequality…”
Získať plný text

Selecting a subset of diverse points based on the squared euclidean distance Autor Eremeev, Anton V., Kel’manov, Alexander V., Kovalyov, Mikhail Y., Pyatkin, Artem V.

“…In this paper we consider two closely related problems of selecting a diverse subset of points with respect to squared Euclidean distance. Given a set of…”
Získať plný text

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence Autor Kel’manov, Alexander, Khamidullin, Sergey, Khandeev, Vladimir, Pyatkin, Artem

“…The following two strongly NP-hard problems are considered. In the first problem, we need to find in the given finite set of points in Euclidean space the…”
Získať plný text

An exact algorithm for design of content delivery networks in MPLS environment Autor Krzysztof Walkowiak

“… Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods…”
Získať plný text

An Exact Algorithm for Projection onto a Polyhedral Cone Autor Hu, Xiaomi

“… This paper proposes an exact algorithm for the projection of a vector onto a polyhedral cone, and presents an application to second order polynomial regression subject to a non…”
Získať plný text

The Black and White Traveling Salesman Problem Autor Ghiani, Gianpaolo, Laporte, Gilbert, Semet, Frederic

“… The aim is to design a shortest Hamiltonian tour on G subject to cardinality and length constraints…”
Získať plný text

Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem Autor Ghaffarinasab, Nader

“…This paper addresses the robust uncapacitated multiple allocation p -hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty…”
Získať plný text

Exact algorithms and bounds for the dynamic assignment interdiction problem Autor Sefair, Jorge A., Smith, J. Cole

“… Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint…”
Získať plný text

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem Autor Leitner, Markus

“…) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path…”
Získať plný text