scientific article; zbMATH DE number 680244
zbMATH Open0826.90087MaRDI QIDQ4310697FDOQ4310697
Authors: Katta G. Murty 
Publication date: 31 October 1994
Title of this publication is not available (Why is that?)
Recommendations
simulated annealingheuristicsgenetic algorithmsmodelingoptimality conditionsbranch-and-boundcritical path method in project management
Linear programming (90C05) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Nonlinear programming (90C30) Dynamic programming (90C39) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (24)
- Optimization methods: an applications-oriented primer
- New MIP model for multiprocessor scheduling problem with communication delays
- Title not available (Why is that?)
- Crane scheduling with spatial constraints
- Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management.
- A method to improve integer linear programming problem with branch-and-bound procedure
- Quadratic programming with transaction costs
- Title not available (Why is that?)
- Construction of the largest sensitivity region for general linear programs
- Subtractive clustering based modeling of job sequencing with parametric search
- Clustering problems in optimization models
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- Operations planning. Mixed integer optimization models
- A hybrid genetic/optimization algorithm for a task allocation problem
- Title not available (Why is that?)
- An optimization approach to gene stacking
- Some new perspectives for solving 0--1 integer programming problems using balas method
- Deterministic operations research. Models and methods in linear optimization
- Optimization for decision making. Linear and quadratic models
- Title not available (Why is that?)
- Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach
- Resolving inconsistencies among constraints on the parameters of an MCDA model
- Title not available (Why is that?)
- Pivot versus interior point methods: Pros and cons
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 Q4310697)
