scientific article; zbMATH DE number 3733647
assignmentbranch and boundconvexitycutting planedual programeconomic interpretationelementary textbookgraphsknapsack problemlinear algebramaximal flow problemnetworksoperations researchoptimal solutionsout-of-kilter algorithmperturbationssimplex methodsoftwaretraveling salesman
Extremal problems in graph theory (05C35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to linear algebra (15-01) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
- Further results on the spectral decomposition of an incidence matrix
- Revisiting the 0,1 assignment problem
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives
- SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS
- Classes of matrices for the traveling salesman problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3920982)
