Handbook of Approximation Algorithms and Metaheuristics
From MaRDI portal
Publication:3416500
DOI10.1201/9781420010749zbMath1138.90001OpenAlexW4300273322MaRDI QIDQ3416500
No author found.
Publication date: 22 January 2007
Full work available at URL: https://doi.org/10.1201/9781420010749
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts, Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds, The terminal-oriented ship stowage planning problem, Multiobjective GRASP with path relinking, Deep learning based classification of time series of Chen and Rössler chaotic systems over their graphic images, Classification of applied methods of combinatorial optimization, Bin packing and cutting stock problems: mathematical models and exact algorithms, Optimization in Designing Complex Communication Networks, Strong minimum energy hierarchical topology in wireless sensor networks, An AFPTAS for variable sized bin packing with general activation costs, Metaheuristics and cooperative approaches for the bi-objective ring star problem, Approximation and online algorithms for multidimensional bin packing: a survey, On the balanceability of some graph classes, Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality, Reinforcement learning for combinatorial optimization: a survey, Inapproximability ratios for crossing number, Selfish bin packing with cardinality constraints, An improved genetic algorithm for developing deterministic OTP key generator, Solving the edge‐disjoint paths problem using a two‐stage method, Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, Partial multicovering and the \(d\)-consecutive ones property, A Survey of the Generalized Assignment Problem and Its Applications, Improved approximation algorithms for directed Steiner forest, Geometric spanning trees minimizing the Wiener index, Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques, Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances, Online bin covering with limited migration, Unnamed Item, Finding Triangles for Maximum Planar Subgraphs, Unnamed Item, A survey on the structure of approximation classes, Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review, Method of rescheduling for hybrid production lines with intermediate buffers, A personal perspective on problem solving by general purpose solvers, Nature inspired meta-heuristic algorithms for solving the load-balancing problem in cloud environments, Geometric and LP-based heuristics for angular travelling salesman problems in the plane, Improving the extraction and expansion method for large graph coloring, Improved approximation algorithms for maximum lifetime problems in wireless networks, Unnamed Item, A novel order diminution of LTI systems using big bang big crunch optimization and Routh approximation, Differential approximation schemes for half-product related functions and their scheduling applications, On \(k\)-connectivity problems with sharpened triangle inequality, The Greedy Spanner Is Existentially Optimal, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Online Bin Covering with Limited Migration, Exact recovery in the hypergraph stochastic block model: a spectral algorithm, Exact algorithms for the two-dimensional strip packing problem with and without rotations, Flows with Unit Path Capacities and Related Packing and Covering Problems, Function simulation, graph grammars and colourings, Large-scale parallelism for constraint-based local search: the costas array case study, Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model, On Some Average Properties of Convex Mosaics, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning, Offline black and white bin packing, Single source unsplittable flows with arc-wise lower and upper bounds
