Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

Cited in

(only showing first 100 items - show all)

Global solution of bilevel programs with a nonconvex inner program
A linearization framework for unconstrained quadratic (0-1) problems
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
Lower and upper bounds for linear production games
Abandonment value in capital budeting: A mathematical programming approach
A note on solving quadratic programs using mixed-integer programming
Backtracking of jobs in one-dimensional machine location problems
Specialized inspection problems in serial production systems
Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
Binary interactions and subset choice
Ranking in quadratic integer programming problems
Configuration of manufacturing software through capability specification and selection
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
Nonlinear integer programming for optimal allocation in stratified sampling
A matheuristic approach for the design of multiproduct batch plants with parallel production lines
Binary extended formulations of polyhedral mixed-integer sets
Integrated approach to network design and frequency setting problem in railway rapid transit systems
Fractional 0-1 programming: applications and algorithms
Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
An MILP model for planning of batch plants operating in a campaign-mode
On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
Minimal arc-sets spanning dicycles
On linearization techniques for budget-constrained binary quadratic programming problems
Compact linearization for binary quadratic problems subject to assignment constraints
A note on linearized reformulations for a class of bilevel linear integer problems
Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
The quadratic shortest path problem: complexity, approximability, and solution methods
A computational study on the quadratic knapsack problem with multiple constraints
Fair transfer price and inventory holding policies in two-enterprise supply chains
A simple recipe for concise mixed 0-1 linearizations
A discrete optimization model for preserving biological diversity
Global solution of nonlinear mixed-integer bilevel programs
Behavioral modeling in weight loss interventions
Measuring diversity. A review and an empirical analysis
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
Compact mixed-integer programming formulations in quadratic optimization
Non-convex nested Benders decomposition
A Lagrangian dual method for two-stage robust optimization with binary uncertainties
Dantzig-Wolfe reformulations for binary quadratic problems
Designing an optimal sequence of non-pharmaceutical interventions for controlling COVID-19
Discrete dynamical system approaches for Boolean polynomial optimization
Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
Structured linear reformulation of binary quadratically constrained quadratic programs
The quadratic cycle cover problem: special cases and efficient bounds
Subset selection for multiple linear regression via optimization
Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
t-linearization for the maximum diversity problem
Multistage robust mixed-integer optimization under endogenous uncertainty
RLT insights into lift-and-project closures
Linearization of mixed-integer products
Theoretical and computational study of several linearisation techniques for binary quadratic problems
Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
A binarisation heuristic for non-convex quadratic programming with box constraints
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
Optimal design of multi-echelon supply chain networks under normally distributed demand
Mathematical optimization ideas for biodiversity conservation
A branch and bound algorithm for the maximum diversity problem
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
Solving multi-period interdiction via generalized Bender's decomposition
Stochastic dual dynamic integer programming
Linear forms of nonlinear expressions: new insights on old ideas
An improved linearization strategy for zero-one quadratic programming problems
Compact integer-programming models for extracting subsets of stimuli from confusion matrices
A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
Global optimization of a quadratic function subject to a bounded mixed integer constraint set
An algorithm for indefinite integer quadratic programming
Mathematical models and approximate solution approaches for the stochastic bin packing problem
Skyport location problem for urban air mobility system
The bipartite Boolean quadric polytope
Weapon-target assignment problem: exact and approximate solution algorithms
Exact solution approaches for a class of bilevel fractional programs
An optimization approach for real time evacuation reroute planning
Exact solution approaches for bilevel assignment problems
Mixed integer linear programming formulation techniques
Tightening concise linear reformulations of 0-1 cubic programs
From Graph Orientation to the Unweighted Maximum Cut
Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
A computational study for bilevel quadratic programs using semidefinite relaxations
On solving manufacturing cell formation via bicluster editing
A class of algorithms for mixed-integer bilevel min-max optimization
An Improved MIP Formulation for Products of Discrete and Continuous Variables
Solution approaches for the cutting stock problem with setup cost
A planar single facility location and border crossing problem
A bottom-up optimization model for the long-term energy planning of the Greek power supply sector integrating mainland and insular electric systems
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
On the Quadratic Programming Approach for Hub Location Problems
Models and methods of solution of quadratic integer programming problems
Reconstructing convex matrices by integer programming approaches
Mixed-integer quadratic programming
A hybrid approach to discrete mathematical programming

This page was built for publication: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4081009)