Combinatorial optimization

Ningún artículo

3 dimensional matching All pairs testing Divide and conquer algorithm Dynamic programming Eight queens puzzle Greedy algorithm Kalmanson combinatorial conditions Knapsack problem Route inspection problem Sat Set packing Stable roommates problem 1 center problem Bareiss algorithm Bin covering problem Bipartite dimension Branch and bound Branch and cut Branch and price Bridge and torch problem Combinatorial data analysis Combinatorial search Continuous knapsack problem Covering graph Covering problems Cutting stock problem Disk covering problem Edge cycle cover Egalitarian item allocation European chapter on combinatorial optimization Floorplan Generalized assignment problem Greedy randomized adaptive search procedure Hungarian algorithm Integer programming Jack edmonds Kernighan lin algorithm Lin kernighan heuristic Linear bottleneck assignment problem Linear programming relaxation Matroid intersection Matroid parity problem Minimum relevant variables in linear system Multidimensional assignment problem Optimal network design Parametric search Pivot element Quadratic assignment problem Quadratic bottleneck assignment problem Quadratic knapsack problem Revised simplex method Simplex algorithm Smallest circle problem Snow plow routing problem Steiner travelling salesman problem Subadditive set function Submodular flow Submodular set function Superadditive set function Symmetry breaking constraints Utility functions on indivisible goods Vehicle routing problem Weapon target assignment problem

Todavía no hay artículos en esta categoría — están en camino.