A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
type: Item
instance of: scholarly article
title: A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
zbMATH Open document ID: 0681.90061
DOI: 10.1016/0305-0548(90)90023-Z
author: Patrick G. McKeown
author: Cliff T. Ragsdale
published in: Computers \& Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4116306
zbMATH Keywords: additional constraints
zbMATH Keywords: data preprocessing
zbMATH Keywords: branch-and-bound
zbMATH Keywords: fixed charge problem
zbMATH Keywords: computational results
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: A New Optimization Method for Large Scale Fixed Charge Transportation Problems
cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
cites work: Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
cites work: A branch-and-bound algorithm for solving fixed charge problems
cites work: The fixed charge problem
cites work: Concave minimization over a convex polyhedron
cites work: Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
cites work: Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
cites work: The interactive fixed charge linear programming problem
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
full work available at URL: 0305-0548(90)90023-z
OpenAlex ID: W1994413951
description: scientific article; zbMATH DE number 4116306