A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems

From MaRDI portal
Publication:3990570

DOI10.1287/opre.40.1.S109zbMath0771.90072OpenAlexW2075740111MaRDI QIDQ3990570

Ossama Kettani, Muhittin Oral

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.1.s109




Related Items (40)

Optimal procurement decisions in the presence of total quantity discounts and alternative product recipesAn efficient schedulability analysis for optimizing systems with adaptive mixed-criticality schedulingNormalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problemsThe double role of the weight factor in the goal programming modelA simple recipe for concise mixed 0-1 linearizationsMathematical Programming Models and Exact AlgorithmsSerial correlation estimation through the imprecise goal programming modelA new mixed-integer linear programming model for rescue path planning in uncertain adversarial environmentGlobal optimization of bilinear programs with a multiparametric disaggregation techniqueMathematical models and approximate solution approaches for the stochastic bin packing problemAn efficient linearization technique for mixed 0-1 polynomial problemInductive linearization for binary quadratic programs with linear constraintsGoal Programming Model for Fire and Emergency Service Facilities Site SelectionQuality control system design through the goal programming model and the satisfaction functionsQuantifying the benefits of customized vaccination strategies: A network‐based optimization approachTwo-stage quadratic integer programs with stochastic right-hand sidesOvercoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone FlexibilityMixed integer programming for the 0--1 maximum probability model.Compact linearization for binary quadratic problems subject to assignment constraintsLinear forms of nonlinear expressions: new insights on old ideasA Lagrangian decomposition approach to computing feasible solutions for quadratic binary programsProject evaluation and selection in a network of collaboration: A consensual disaggregation multi-criterion approachDecision-maker's preferences modeling in the stochastic goal programmingAn algorithm for multiparametric min max 0-1-integer programming problems relative to the objective functionThe Multistatic Sonar Location Problem and Mixed-Integer ProgrammingAlternative fuel station location model with demand learningAn algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective functionMixed Integer Linear Programming Formulation TechniquesSolving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functionsSolving multistatic sonar location problems with mixed-integer programmingBinary interactions and subset choiceA linearization framework for unconstrained quadratic (0-1) problemsImproved compact linearizations for the unconstrained quadratic 0-1 minimization problemConcise RLT forms of binary programs: A computational study of the quadratic knapsack problemAn efficient linearization approach for mixed-integer problemsA linearization method for mixed 0--1 polynomial programsOn the optimization of supply chain networking decisionsA fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logisticsComputational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein designAggregate planning through the imprecise goal programming model: integration of the manager's preferences




This page was built for publication: A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems