A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
From MaRDI portal
Recommendations
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- An efficient linearization approach for mixed-integer problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- A linearization technique for quadratic integer programming with box constraint
- A new linearization technique for multi-quadratic 0-1 programming problems.
Cited in
(49)- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
- A linearization framework for unconstrained quadratic (0-1) problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Binary interactions and subset choice
- Mixed integer programming for the 0--1 maximum probability model.
- An efficient linearization approach for mixed-integer problems
- A linearization method for mixed 0--1 polynomial programs
- On linearization techniques for budget-constrained binary quadratic programming problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- On the optimization of supply chain networking decisions
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes
- The double role of the weight factor in the goal programming model
- A simple recipe for concise mixed 0-1 linearizations
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Solving multistatic sonar location problems with mixed-integer programming
- A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics
- An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling
- Quality control system design through the goal programming model and the satisfaction functions
- Linear forms of nonlinear expressions: new insights on old ideas
- Compact linearization for binary quadratic problems
- Alternative fuel station location model with demand learning
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Mixed integer linear programming formulation techniques
- Aggregate planning through the imprecise goal programming model: integration of the manager's preferences
- A linearization technique for quadratic integer programming with box constraint
- A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- Linear Reformulations of Integer Quadratic Programs
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Two-stage quadratic integer programs with stochastic right-hand sides
- Overcoming the key challenges in de novo protein design: enhancing computational efficiency and incorporating true backbone flexibility
- The multistatic sonar location problem and mixed-integer programming
- Mathematical programming models and exact algorithms
- An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
- Project evaluation and selection in a network of collaboration: A consensual disaggregation multi-criterion approach
- Inductive linearization for binary quadratic programs with linear constraints
- Goal Programming Model for Fire and Emergency Service Facilities Site Selection
- An efficient linearization technique for mixed 0-1 polynomial problem
- Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach
- Efficient configuration of heterogeneous multistatic sonar networks: a mixed-integer linear programming approach
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Defending a city from multi-drone attacks: a sequential Stackelberg security games approach
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Decision-maker's preferences modeling in the stochastic goal programming
- Serial correlation estimation through the imprecise goal programming model
This page was built for publication: A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990570)
