↓ Skip to main content

Learning and Intelligent Optimization

Overview of attention for book
Cover of 'Learning and Intelligent Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Learning a Stopping Criterion for Local Search
  3. Altmetric Badge
    Chapter 2 Surrogate Assisted Feature Computation for Continuous Problems
  4. Altmetric Badge
    Chapter 3 MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework
  5. Altmetric Badge
    Chapter 4 Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers
  6. Altmetric Badge
    Chapter 5 Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global Optimization
  7. Altmetric Badge
    Chapter 6 Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection
  8. Altmetric Badge
    Chapter 7 Designing and Comparing Multiple Portfolios of Parameter Configurations for Online Algorithm Selection
  9. Altmetric Badge
    Chapter 8 Portfolios of Subgraph Isomorphism Algorithms
  10. Altmetric Badge
    Chapter 9 Structure-Preserving Instance Generation
  11. Altmetric Badge
    Chapter 10 Feature Selection Using Tabu Search with Learning Memory: Learning Tabu Search
  12. Altmetric Badge
    Chapter 11 The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-Art Inexact TSP Solvers
  13. Altmetric Badge
    Chapter 12 Requests Management for Smartphone-Based Matching Applications Using a Multi-agent Approach
  14. Altmetric Badge
    Chapter 13 Self-organizing Neural Network for Adaptive Operator Selection in Evolutionary Search
  15. Altmetric Badge
    Chapter 14 Quantifying the Similarity of Algorithm Configurations
  16. Altmetric Badge
    Chapter 15 Neighborhood Synthesis from an Ensemble of MIP and CP Models
  17. Altmetric Badge
    Chapter 16 Parallelizing Constraint Solvers for Hard RCPSP Instances
  18. Altmetric Badge
    Chapter 17 Characterization of Neighborhood Behaviours in a Multi-neighborhood Local Search Algorithm
  19. Altmetric Badge
    Chapter 18 Constraint Programming and Machine Learning for Interactive Soccer Analysis
  20. Altmetric Badge
    Chapter 19 A Matheuristic Approach for the p -Cable Trench Problem
  21. Altmetric Badge
    Chapter 20 An Empirical Study of Per-instance Algorithm Scheduling
  22. Altmetric Badge
    Chapter 21 Dynamic Strategy to Diversify Search Using a History Map in Parallel Solving
  23. Altmetric Badge
    Chapter 22 Faster Model-Based Optimization Through Resource-Aware Scheduling Strategies
  24. Altmetric Badge
    Chapter 23 Risk-Averse Anticipation for Dynamic Vehicle Routing
  25. Altmetric Badge
    Chapter 24 Solving GENOPT Problems with the Use of ExaMin Solver
  26. Altmetric Badge
    Chapter 25 Hybridisation of Evolutionary Algorithms Through Hyper-heuristics for Global Continuous Optimisation
Attention for Chapter 6: Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection
Altmetric Badge

Citations

dimensions_citation
3 Dimensions
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection
Chapter number 6
Book title
Learning and Intelligent Optimization
Published by
Springer, Cham, May 2016
DOI 10.1007/978-3-319-50349-3_6
Book ISBNs
978-3-31-950348-6, 978-3-31-950349-3
Authors

Laura Climent, Barry O’Sullivan, Steven D. Prestwich, Climent, Laura, O’Sullivan, Barry, Prestwich, Steven D.