Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,800,817 papers from all fields of science
Search
Sign In
Create Free Account
Integer programming
Known as:
Integer constraint
, Integer linear optimization
, Integer Programming Problem
Expand
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APMonitor
Algorithm
Ant colony optimization algorithms
Arc routing
Expand
Broader (2)
Combinatorial optimization
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Nonintrusive Load Monitoring Algorithm Using Mixed-Integer Linear Programming
Fernando Marcos Wittmann
,
J. López
,
M. J. Rider
IEEE transactions on consumer electronics
2018
Corpus ID: 49651205
This paper presents a nonintrusive load monitoring (NILM) algorithm based on mixed-integer linear programming. The formulation…
Expand
Highly Cited
2016
Highly Cited
2016
The L-shape search method for triobjective integer programming
N. Boland
,
H. Charkhgard
,
M. Savelsbergh
Mathematical Programming Computation
2016
Corpus ID: 30962739
We present a new criterion space search method, the L-shape search method, for finding all nondominated points of a triobjective…
Expand
Highly Cited
2016
Highly Cited
2016
Aggressive quadrotor flight through cluttered environments using mixed integer programming
Benoit Landry
,
Robin Deits
,
Peter R. Florence
,
Russ Tedrake
IEEE International Conference on Robotics and…
2016
Corpus ID: 11062059
Quadrotor flight has typically been limited to sparse environments due to numerical complications that arise when dealing with…
Expand
Highly Cited
2011
Highly Cited
2011
Multi-Objective Integer Programming: An Improved Recursive Algorithm
M. Özlen
,
Benjamin A. Burton
,
C. MacRae
Journal of Optimization Theory and Applications
2011
Corpus ID: 10276331
This paper introduces an improved recursive algorithm to generate the set of all nondominated objective vectors for the Multi…
Expand
Review
2011
Review
2011
Two‐Stage Stochastic Integer Programming: A Brief Introduction
Shabbir Ahmed
2011
Corpus ID: 7505282
Stochastic integer programming problems combine the difficulty of stochastic programming with integer programming. In this…
Expand
Highly Cited
2007
Highly Cited
2007
A trust region SQP algorithm for mixed-integer nonlinear programming
Oliver Exler
,
K. Schittkowski
Optimization Letters
2007
Corpus ID: 15897309
We propose a modified sequential quadratic programming method for solving mixed-integer nonlinear programming problems. Under the…
Expand
Highly Cited
2007
Highly Cited
2007
An optimization model for the container pre-marshalling problem
Yusin Lee
,
N. Hsu
Computers & Operations Research
2007
Corpus ID: 42863001
Highly Cited
2001
Highly Cited
2001
Experiences with Mixed Integer Linear Programming-Based Approaches in Short-Term Hydro Scheduling
G. Chang
,
M. Aganagic
,
+4 authors
M. Christoforidis
IEEE Power Engineering Review
2001
Corpus ID: 43566170
This paper describes experiences with mixed integer linear programming (MILP)-based approaches on the short-term hydro scheduling…
Expand
Highly Cited
2000
Highly Cited
2000
The capacitated multiple allocation hub location problem: Formulations and algorithms
Jamie Ebery
,
M. Krishnamoorthy
,
Andreas T. Ernst
,
N. Boland
European Journal of Operational Research
2000
Corpus ID: 43387020
Highly Cited
1999
Highly Cited
1999
Linear and integer programming - theory and practice
G. Sierksma
The Pure and Applied Mathematics
1999
Corpus ID: 117824051
Linear optimisation basic concepts Dantzig's simplex method duality and optimality sensitivity analysis karmarkar's interior path…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE