Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

cutting-plane method · Vinony

EntityQ1762039· pop 9· linked from 126 articles

cutting-plane method

Sign in to save

optimization technique for solving (mixed) integer linear programs

Connections

mathematical optimization

linear programming

simplex algorithm

greedy algorithm

Bellman–Ford algorithm

convex optimization

feasible region

Subgradient method

International Standard Book Number

digital object identifier

Dijkstra's algorithm

dynamic programming

Lagrange multiplier

Prim's algorithm

evolutionary algorithm

minimum spanning tree

Categories

Optimization algorithms and methods

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

linear programming

Entitydist 0.41

General Algebraic Modeling System

Entitydist 0.48

Fourier–Motzkin elimination

Entitydist 0.52

global optimization

Entitydist 0.55

Gaussian elimination

Entitydist 0.57

Entitydist 0.57

Ramer–Douglas–Peucker algorithm

Entitydist 0.58

cut-elimination

Entitydist 0.58

Continuous optimization

Entitydist 0.59

Fulkerson Prize

Entitydist 0.62

simulated annealing

Entitydist 0.64

dead code elimination

Entitydist 0.64

What links here126 pages

convex optimization

branch and bound

hypohamiltonian graph

approximation algorithm

nonlinear programming

golden section search

Dijkstra's algorithm

Broyden–Fletcher–Goldfarb–Shanno algorithm

Firefly algorithm

integer programming

ant colony optimization algorithms

polyhedral combinatorics

Dinic's algorithm

register allocation

Newton's method in optimization

Coordinate descent

quadratic programming

Quasi-Newton method

Nelder–Mead method

linear programming relaxation

linear programming