Computational comparison on the partitioning strategies in multiple choice integer programming
type: Item
instance of: scholarly article
title: Computational comparison on the partitioning strategies in multiple choice integer programming
zbMATH Open document ID: 0913.90220
DOI: 10.1016/0377-2217(94)00161-8
author: Dennis Bricker
author: Edward Yu-Hsien Lin
published in: European Journal of Operational Research
publication date: 1998-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1208542
zbMATH Keywords: weighted-mean-method
zbMATH Keywords: reformulation-and-transformation-technique
zbMATH Keywords: special ordered set
zbMATH Keywords: branch-and-bound
zbMATH Keywords: multiple choice integer programming
describes a project that uses: APL2
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00161-8
OpenAlex ID: W1996382026
cites work: The knapsack problem with disjoint multiple-choice constraints
cites work: Improved penalty calculations for a mixed integer branch-and-bound algorithm
cites work: Global optimization using special ordered sets
cites work: Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
cites work: A heuristic for multiple choice programming
cites work: A dynamic programming algorithm for multiple-choice constraints
cites work: Reporting computational experiments in mathematical programming
cites work: Generalized upper bounding techniques
cites work: A branch and bound algorithm for solving the multiple-choice knapsack problem
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: Q5610172
cites work: Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
cites work: A note on the knapsack problem with special ordered sets
cites work: On the calculation of true and pseudo penalties in multiple choice integer programming
cites work: An Algorithm for the Traveling Salesman Problem
cites work: An ideal column algorithm for integer programs with special ordered sets of variables
cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Modeling Facility Location Problems as Generalized Assignment Problems
cites work: Branch and Bound Methods for Multi-Item Scheduling
cites work: Q4103327
cites work: School Timetabling—A Case in Large Binary Integer Linear Programming
cites work: Integer Programming Models for Sales Resource Allocation
description: scientific article; zbMATH DE number 1208542