Integer and Combinatorial Optimization

  title={Integer and Combinatorial Optimization},
  author={Karla L. Hoffman and Ted K. Ralphs},
Integer optimization problems are concerned with the efficient allocation of limited resources to meet a desired objective when some of the resources in question can only be divided into discrete parts. In such cases, the divisibility constraints on these resources, which may be people, machines, or other discrete inputs, may restrict the possible alternatives to a finite set. Nevertheless, there are usually too many alternatives to make complete enumeration a viable option for instances of… CONTINUE READING