Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
type: Item
instance of: scholarly article
title: Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
zbMATH Open document ID: 0766.90060
DOI: 10.1016/0377-2217(92)90210-Z
author: Muhittin Oral
author: Ossama Kettani
published in: European Journal of Operational Research
publication date: 1992-10-06T00:00:00Z
review text: A technique for the equivalent formulation of 0-1 nonlinear optimization problems is proposed. Quadratic and cubic cross-product expressions on 0- 1 variables are linearized with only \(n\) extra linear constraints. Numerical examples and comparative computational results are given.
reviewed by: J.Mitev
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 68475
zbMATH Keywords: equivalent formulation
MaRDI profile type: Publication
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
cites work: Timetabling problem for university as assignment of activities to resources
cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
cites work: A Layout Planning System with Multiple Criteria and a Variable Domain Representation
cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: An Integer Programming Procedure for Assembly System Design Problems
cites work: Q5538300
cites work: Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems
cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming
cites work: A methodology for multicriteria network partitioning
cites work: A Balasian-Based Algorithm for Zero-One Polynomial Programming
full work available at URL: 0377-2217(92)90210-z
OpenAlex ID: W2036287410
description: scientific article; zbMATH DE number 68475