scientific article; zbMATH DE number 680244
From MaRDI portal
Publication:4310697
zbMath0826.90087MaRDI QIDQ4310697
Publication date: 31 October 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicsmodelingoptimality conditionssimulated annealingbranch-and-boundgenetic algorithmscritical path method in project management
Integer programming (90C10) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (15)
Crane scheduling with spatial constraints ⋮ Clustering problems in optimization models ⋮ A method to improve integer linear programming problem with branch-and-bound procedure ⋮ Construction of the largest sensitivity region for general linear programs ⋮ Quadratic programming with transaction costs ⋮ Subtractive clustering based modeling of job sequencing with parametric search ⋮ Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management. ⋮ An optimization approach to gene stacking ⋮ New MIP model for multiprocessor scheduling problem with communication delays ⋮ Some new perspectives for solving 0--1 integer programming problems using balas method ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem ⋮ Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach ⋮ A hybrid genetic/optimization algorithm for a task allocation problem ⋮ Pivot versus interior point methods: Pros and cons ⋮ Resolving inconsistencies among constraints on the parameters of an MCDA model
This page was built for publication:
