Pages that link to "Item:Q3416500"

The following pages link to Handbook of Approximation Algorithms and Metaheuristics (Q3416500):

Displaying 50 items.

• The terminal-oriented ship stowage planning problem (Q297116) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Strong minimum energy hierarchical topology in wireless sensor networks (Q328707) (← links)
• An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
• Selfish bin packing with cardinality constraints (Q391143) (← links)
• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review (Q460389) (← links)
• Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)
• Design and analysis of approximation algorithms (Q648055) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
• Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
• Classification of applied methods of combinatorial optimization (Q844352) (← links)
• On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
• An improved genetic algorithm for developing deterministic OTP key generator (Q1688108) (← links)
• A novel order diminution of LTI systems using big bang big crunch optimization and Routh approximation (Q1789521) (← links)
• Nature inspired meta-heuristic algorithms for solving the load-balancing problem in cloud environments (Q2002862) (← links)
• Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
• Single source unsplittable flows with arc-wise lower and upper bounds (Q2118142) (← links)
• Deep learning based classification of time series of Chen and Rössler chaotic systems over their graphic images (Q2140130) (← links)
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
• Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
• Offline black and white bin packing (Q2355707) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Inapproximability ratios for crossing number (Q2413159) (← links)
• Multiobjective GRASP with path relinking (Q2629598) (← links)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
• On the balanceability of some graph classes (Q2659061) (← links)
• Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
• Online bin covering with limited migration (Q2689369) (← links)
• Algorithmics for hard problems. Introduction to combinatorial optimization, randomization, approximation, and heuristics (Q2701740) (← links)
• Function simulation, graph grammars and colourings (Q2855758) (← links)
• Optimization in Designing Complex Communication Networks (Q2913773) (← links)
• Finding Triangles for Maximum Planar Subgraphs (Q2980925) (← links)
• A personal perspective on problem solving by general purpose solvers (Q3566446) (← links)
• (Q4638871) (← links)
• The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
• Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
• Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds (Q5041753) (← links)
• Online Bin Covering with Limited Migration (Q5075753) (← links)
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
• (Q5089171) (← links)
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
• Method of rescheduling for hybrid production lines with intermediate buffers (Q5150030) (← links)
• Flows with Unit Path Capacities and Related Packing and Covering Problems (Q5505656) (← links)