Algorithms for Other Problems
Evolutionary algorithms for timetable problems
... evolutionary algorithms, which turn out to be useful as a general-purpose optimization tool, due to their high flexibility accompanied by conceptual ...the problems illustrated ...
9
Algorithms for Variants of Routing Problems
... biased-randomized algorithms are easily parallelizable and able to provide real-time solutions to complex vehicle routing problems with stochastic ...
77
Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems
... memetic algorithms are pointed out: ...constrained problems, where penalties are used for violated constraints, and local search can act as a repair mechanism ...
22
Iterative algorithms for monotone inclusion problems, fixed point problems and minimization problems
... of problems arising in structural analysis, mechanics, economics and others; see, for instance [, ...inclusion problems have been extended and generalized, and there are many algorithms for solving ...
23
Superimposed algorithms for the split equilibrium problems and fixed point problems
... Comput. (2010). doi:10.1016/j.amc.2010.11.058 13. Ceng, LC, Ansari, QH, Yao, JC: Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem. Nonlinear Anal. 75, 2116-2125 (2012) 14. ...
15
Algorithms for high dimensional stabbing problems
... We give algorithms based on linear programming for various hyperplane stabbing problems where the ob- jects are line segments or convex polyhedra.. Computational ge[r] ...
10
Approximation algorithms for packing and buffering problems
... optimization problems can be formulated as integer linear programs, that is linear programs with the additional constraint that variables may take only integer ...approximation algorithms are based on ...
107
Genetic algorithms for multiple choice problems
... assignment problems, outperforming both genetic algorithms and constraint programming on their ...harder problems, although in his case due to the ‘softness’ of the main constraint it was ...
258
Algorithms for network design and routing problems
... Routing problems are the subject of chapters 3 and 4 where we describe new exact algorithms for solving the Period Routing Problem and the Pickup and De- livery Problem with Time ...
191
Projective algorithms for solving complementarity problems
... also requires 2 n − 1, while the two-step converges in exactly one cycle with no relax- ation! Of course, these examples are contrived and are meant only as pathologies. 8. Conclusion and possible future directions. ...
15
Multilevel algorithms for the optimization of structured problems
... multilevel algorithms. We also show that several existing optimization algorithms are in fact special cases under the general framework of multilevel ...study problems arising from discretizations of ...
235
Efficient Algorithms for Graph Optimization Problems
... ent algorithms for solving these problems, including the development of novel heuristic improvements and the thorough elaboration of important ...optimization algorithms is usually quite different ...
135
Cluster Description Formats, Problems and Algorithms
... mats, problems and algorithms for clusters of numerical records using sets of isothetic ...to other scenarios requiring discriminative summarization of ar- bitrary sets of labeled ...
5
Result Verification Algorithms for Optimization Problems
... verification algorithms for some opti mization ...verification algorithms for NP-complete or AP-hard problems, and for approximation algorithms for AP-hard prob ...verification ...
18
Generalized Eigenvalue Problems: Algorithms and Applications.
... ABSTRACT MIN, EUN JEONG. Generalized Eigenvalue Problems: Algorithms and Applications. (Under the direction of Dr. Hua Zhou.) Nowadays we encounter massive data from various fields, and there are growing ...
112
Models and algorithms for hard optimization problems
... optimization problems, whose concept was introduced in ...genetic algorithms [112], ant colony optimization [71], variable neighborhood search ...optimization problems by finding near-optimal, and ...
221
Parameterized Algorithms for Graph Partitioning Problems
... NP-hard problems like maxi- mum independent set, chromatic number, minimum dominating set have straightforward dynamic programming algorithms when the input graph is a ...graph problems are shown to ...
107
IMPROVED ALGORITHMS FOR STRING SEARCHING PROBLEMS
... parallel algorithms are better than the backward matching ones, and the best backward matching algorithm, eBG, is only competitive for high significance levels and fairly short patterns, whereas in traditional ...
153
Algorithms for university course scheduling problems
... UCS problems is increasing. Such algorithms include tabu search by Lü and Hao [7], simulated annealing by Zhanget ...annealing algorithms in order to solve this problem in large ...These ...
7
Algorithms and Models For Combinatorial Optimization Problems
... 2.2 Literature Review. The GTSP was introduced simultaneously by Srivastava et al. [50] and Henry-Labordere [19] in 1969. In 1970 Saksena [44] studied the symmetric and asymmetric cases. The GTSP has been studied later ...
100