Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
From MaRDI portal
Publication:4081009
DOI10.1287/mnsc.22.4.455zbMath0318.90044OpenAlexW2041818766WikidataQ60395657 ScholiaQ60395657MaRDI QIDQ4081009
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/04d3d5837693ca977607c2647f2f14601fb5b18e
Applications of mathematical programming (90C90) Integer programming (90C10) Nonlinear programming (90C30)
Related Items
Introduction to QUBO, Mathematical Programming Models and Exact Algorithms, The Bipartite QUBO, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, An algorithm for indefinite integer quadratic programming, SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY, The Rank-One Quadratic Assignment Problem, A Scalable Algorithm for Sparse Portfolio Selection, 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, Solving multiplicative programs by binary-encoding the multiplication operation, Exact solution approaches for a class of bilevel fractional programs, An exact cutting plane method for the Euclidean max-sum diversity problem, A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem, Mixed-integer linear-fractional programming model and it's linear analogue for reducing inconsistency of pairwise comparison matrices, Data‐driven predictive control for a class of uncertain control‐affine systems, Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach, Shortest paths with exclusive-disjunction arc pairs conflicts, Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Models and methods of solution of quadratic integer programming problems, An improved linearization strategy for zero-one quadratic programming problems, LP Formulations for Polynomial Optimization Problems, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, An Improved MIP Formulation for Products of Discrete and Continuous Variables, The Multistatic Sonar Location Problem and Mixed-Integer Programming, A pegging algorithm for the nonlinear resource allocation problem, Compact integer-programming models for extracting subsets of stimuli from confusion matrices, A hybrid approach to discrete mathematical programming, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Mixed Integer Linear Programming Formulation Techniques, Tightening concise linear reformulations of 0-1 cubic programs, LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM, From Graph Orientation to the Unweighted Maximum Cut, On the Quadratic Programming Approach for Hub Location Problems, Optimal maintenance planning and crew allocation for multipurpose batch plants, Decision Diagram Decomposition for Quadratically Constrained Binary Optimization, A Mixed-Integer Fractional Optimization Approach to Best Subset Selection, Mixed-integer quadratic programming, Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design, An optimization approach for real time evacuation reroute planning, Dantzig-Wolfe reformulations for binary quadratic problems, Exact solution approaches for bilevel assignment problems, Abandonment value in capital budeting: A mathematical programming approach, A simple recipe for concise mixed 0-1 linearizations, A matheuristic approach for the design of multiproduct batch plants with parallel production lines, Exact solution method to solve large scale integer quadratic multidimensional knapsack problems, A branch and bound algorithm for the maximum diversity problem, 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, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, A class of algorithms for mixed-integer bilevel min-max optimization, Binary extended formulations of polyhedral mixed-integer sets, Integrated approach to network design and frequency setting problem in railway rapid transit systems, 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, Designing an optimal sequence of non-pharmaceutical interventions for controlling COVID-19, A discrete optimization model for preserving biological diversity, Discrete dynamical system approaches for Boolean polynomial optimization, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, A note on solving quadratic programs using mixed-integer programming, Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering, Solving multi-period interdiction via generalized Bender's decomposition, Structured linear reformulation of binary quadratically constrained quadratic programs, The quadratic cycle cover problem: special cases and efficient bounds, Mathematical model for scheduling operations in cascaded continuous processing units, Fractional 0-1 programming: applications and algorithms, Backtracking of jobs in one-dimensional machine location problems, Specialized inspection problems in serial production systems, Reconstructing convex matrices by integer programming approaches, An efficient linearization technique for mixed 0-1 polynomial problem, Subset selection for multiple linear regression via optimization, Stochastic dual dynamic integer programming, 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, A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts, Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme, Two-stage quadratic integer programs with stochastic right-hand sides, Improving an exact approach for solving separable integer quadratic knapsack problems, Modeling outranking process as a mathematical programming problem, Minimal arc-sets spanning dicycles, On linearization techniques for budget-constrained binary quadratic programming problems, Global solution of nonlinear mixed-integer bilevel programs, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Mixed integer programming for the 0--1 maximum probability model., Threshold Boolean form for joint probabilistic constraints with random technology matrix, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Compact linearization for binary quadratic problems subject to assignment constraints, A note on linearized reformulations for a class of bilevel linear integer problems, Extending the QCR method to general mixed-integer programs, Linear forms of nonlinear expressions: new insights on old ideas, Truss topology optimization with discrete design variables by outer approximation, \(t\)-linearization for the maximum diversity problem, Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems, Multistage robust mixed-integer optimization under endogenous uncertainty, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, Behavioral modeling in weight loss interventions, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Mixed-integer bilinear programming problems, The quadratic shortest path problem: complexity, approximability, and solution methods, An improved linearization technique for a class of quadratic 0-1 programming problems, RLT insights into lift-and-project closures, A computational study on the quadratic knapsack problem with multiple constraints, Linearization of mixed-integer products, Measuring diversity. A review and an empirical analysis, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, Linearization of a 0-1 quadratic fractional programming problem, 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, New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains, Global solution of bilevel programs with a nonconvex inner program, Solving multistatic sonar location problems with mixed-integer programming, Binary interactions and subset choice, 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, Ranking in quadratic integer programming problems, An efficient linearization approach for mixed-integer problems, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners, A linearization method for mixed 0--1 polynomial programs, Compact mixed-integer programming formulations in quadratic optimization, A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics, Fair transfer price and inventory holding policies in two-enterprise supply chains, Non-convex nested Benders decomposition, A Lagrangian dual method for two-stage robust optimization with binary uncertainties, Optimal design of multi-echelon supply chain networks under normally distributed demand, Nonlinear integer programming for optimal allocation in stratified sampling, Configuration of manufacturing software through capability specification and selection, Mathematical optimization ideas for biodiversity conservation, Mixed integer linear programming in process scheduling: modeling, algorithms, and applications, A conditional logic approach for strengthening mixed 0-1 linear programs, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, ``Miniaturized linearizations for quadratic 0/1 problems
