Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Approximation and online algorithms for multidimensional bin packing: A survey
The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
Sequencing and scheduling: Algorithms and complexity
EL Lawler, JK Lenstra, AHGR Kan… - Handbooks in operations …, 1993 - Elsevier
Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …
problems, and describes different types of algorithms and the concepts of complexity theory …
[کتاب][B] Approximation algorithms
VV Vazirani - 2001 - Springer
Although this may seem a paradox, all exact science is dominated by the idea of
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …
system to minimize the program completion time is a well-known problem in parallel …
Submodularity in machine learning and artificial intelligence
In this manuscript, we offer a gentle review of submodularity and supermodularity and their
properties. We offer a plethora of submodular definitions; a full description of a number of …
properties. We offer a plethora of submodular definitions; a full description of a number of …
Approximation algorithms for scheduling unrelated parallel machines
We consider the following scheduling problem. There are m parallel machines and n
independent jobs. Each job is to be assigned to one of the machines. The processing of job j …
independent jobs. Each job is to be assigned to one of the machines. The processing of job j …
Property testing and its connection to learning and approximation
In this paper, we consider the question of determining whether a function f has property P or
is ε-far from any function with property P. A property testing algorithm is given a sample of …
is ε-far from any function with property P. A property testing algorithm is given a sample of …
Balanced graph partitioning
In this paper we consider the problem of (k, υ)-balanced graph partitioning-dividing the
vertices of a graph into k almost equal size components (each of size less than υ• nk) so that …
vertices of a graph into k almost equal size components (each of size less than υ• nk) so that …
A polynomial time approximation scheme for the multiple knapsack problem
The multiple knapsack problem (MKP) is a natural and well-known generalization of the
single knapsack problem and is defined as follows. We are given a set of n items and m bins …
single knapsack problem and is defined as follows. We are given a set of n items and m bins …
[کتاب][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …