2001•Encyclopedia of OptimizationRequires access

Decomposition techniques for MILP: Lagrangian relaxation; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming: Lagrangian relaxation; Simplicial pivoting algorithms for integer programming; Time-dependent traveling salesman problem INTEGER PROGRAMMING DUALITY

John Hooker

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Branch and price, Integer programming, Branch and cut, Cutting-plane method, Integer (computer science), Linear programming relaxation, Mathematics, Integer points in convex polyhedra

Back to paper search Browse research topics Original source

Decomposition techniques for MILP: Lagrangian relaxation; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming: Lagrangian relaxation; Simplicial pivoting algorithms for integer programming; Time-dependent traveling salesman problem INTEGER PROGRAMMING DUALITY — Research Paper | ScholarLens