Optimization with additional variables and constraints
type: Item
instance of: scholarly article
title: Optimization with additional variables and constraints
zbMATH Open document ID: 1140.90466
author: Alpár Jüttner
published in: Operations Research Letters
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2173513
zbMATH Keywords: Linear programming
zbMATH Keywords: Strongly polynomial algorithms
zbMATH Keywords: Parametric search
MaRDI profile type: Publication
full work available at URL: j.orl.2004.06.006
OpenAlex ID: W1992361736
cites work: The inverse-parametric knapsack problem
cites work: The quickest flow problem
cites work: Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: On Linear Characterizations of Combinatorial Optimization Problems
cites work: Polynomial algorithms in linear programming
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Using separation algorithms in fixed dimension
cites work: Q4247441
cites work: The maximum concurrent flow problem
cites work: Q3818127
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
DOI: 10.1016/J.ORL.2004.06.006
description: scientific article; zbMATH DE number 2173513