Everything About ___
Live briefing

Everything about Configuration linear program

Linear programming for Combinatorial optimization

The configuration linear program (configuration-LP) is a linear programming technique used for solving combinatorial optimization problems. It was introduced in the context of the cutting stock problem. Later, it has been applied to the bin packing and job scheduling problems. In the configuration-LP, there is a variable for each possible configuration - each possible multiset of items that can fit in a single bin. Usually, the number of configurations is exponential in the problem size, but in some cases it is possible to attain approximate solutions using only a polynomial number of configurations. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Configuration linear programA 5-minute orientation
  2. Skim a recent paper: Optimal Satellite Constellation Configuration Design: A Collection of Mixed Integer Linear ProgramsInfluential work since 2022
  3. Pick up a classic book: Algebraic design theoryThe most-reprinted book on the subject
  4. Read the landmark paper: Efficient large-scale configuration via integer linear programmingCited 5 times
  5. Go sideways: Karmarkar–Karp bin packing algorithmsA closely related topic
  6. Go sideways: High-multiplicity bin packingA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. In bin packing
  2. In bin covering
  3. In machine scheduling

🏆 Landmark papers (most cited)

🆕 Influential since 2022

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics