liveBook · Manning

Combinatorial optimization

Combinatorial optimization is the process of selecting an optimal configuration, assignment, subset, or permutation from a finite or discrete set of possibilities.

How 2 Manning books explain it

Optimization Algorithms: AI techniques for design, planning, and control problems

A combinatorial optimization problem is an optimization problem whose solutions are discrete combinations, sets, or permutations of elements.

How it is used
Classifies discrete solution problems and frames machine learning approaches for tackling them.
How deep it goes
Defines solution types and counts small combinations, then outlines three machine learning approaches without detailing their implementations here.
Examples
Uses fitness-plan selection, cargo-bike parcel loading, and a traveling salesman route through 13 cities.
What you can do after
Evaluate and understand how ordering, repetition, constraints, and machine learning roles shape combinatorial optimization problems.

Read how Optimization Algorithms: AI techniques for design, planning, and control problems explains combinatorial optimization →

Applied Reinforcement Learning

Combinatorial optimization is optimization over a discrete set of possible configurations or decisions.

How it is used
Frames trailer packing as a logistics decision problem and motivates reinforcement learning for its large placement search space.
How deep it goes
Works through the packing problem and environment design, including placement constraints and reward signals.
Examples
Uses boxes with six orientations packed into trailers of varying dimensions.
What you can do after
Build it from scratch by encoding trailer packing as a sequential environment with placement actions and reward signals.

Read how Applied Reinforcement Learning explains combinatorial optimization →

Related concepts

Questions about combinatorial optimization

What is combinatorial optimization?

Combinatorial optimization is the process of selecting an optimal configuration, assignment, subset, or permutation from a finite or discrete set of possibilities.

Which Manning books explain combinatorial optimization?

Optimization Algorithms: AI techniques for design, planning, and control problems and Applied Reinforcement Learning.

What kinds of combinatorial optimization are there?

Kinds of combinatorial optimization include 3d bin packing problem, assembly line balancing problem, capacitated vehicle routing problem and general assignment problem.

What is combinatorial optimization a kind of?

Combinatorial optimization is a kind of optimization. Optimization is the systematic selection or modification of values, configurations, or implementations to improve a defined objective, often subject to constraints.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.