Towards a closer integration of finite domain propagation and simplex-based algorithms
type: Item
instance of: scholarly article
title: Towards a closer integration of finite domain propagation and simplex-based algorithms
zbMATH Open document ID: 0906.90146
DOI: 10.1023/A:1018977712248
author: Mozafar T. Hajian
author: Hani El-Sakkout
author: Jonathan M. Lever
author: Barry Richards
author: Mark Wallace
published in: Annals of Operations Research
publication date: 1998-09-27T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1202752
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: finite domain propagation
zbMATH Keywords: simplex method
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: a:1018977712248
OpenAlex ID: W57567154
Recommended article: Q5751903
Recommended article: Towards a practical parallelisation of the simplex method
Recommended article: Q3471880
Recommended article: Optimization Based Nonoverlapping Domain Decomposition Algorithms and Their Convergence
Recommended article: A Gradient Method Approach to Optimization-Based Multidisciplinary Simulations and Nonoverlapping Domain Decomposition Algorithms
Recommended article: A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
Recommended article: An extension of the simplex algorithm for semi-infinite linear programming
Recommended article: Q3675423
Recommended article: Efficient algorithms for problems of the fictitious domain method in the multiply connected case
Recommended article: Q3321853
description: scientific article; zbMATH DE number 1202752