Pages that link to "Item:Q4081009"
From MaRDI portal
The following pages link to Improved Linear Integer Programming Formulations of Nonlinear Integer Problems (Q4081009):
Displaying 50 items.
- An optimization approach for real time evacuation reroute planning (Q271961) (← links)
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery (Q319010) (← links)
- SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression (Q319716) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- On solving manufacturing cell formation via bicluster editing (Q323416) (← links)
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- A planar single facility location and border crossing problem (Q339663) (← links)
- A bottom-up optimization model for the long-term energy planning of the Greek power supply sector integrating mainland and insular electric systems (Q342215) (← links)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
- Threshold Boolean form for joint probabilistic constraints with random technology matrix (Q463738) (← links)
- Truss topology optimization with discrete design variables by outer approximation (Q486729) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains (Q740632) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications (Q817182) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
- Mathematical model for scheduling operations in cascaded continuous processing units (Q879276) (← links)
- A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts (Q901256) (← links)
- Modeling outranking process as a mathematical programming problem (Q908847) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Linearization of a 0-1 quadratic fractional programming problem (Q998699) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs (Q1026920) (← links)
- Lower and upper bounds for linear production games (Q1027527) (← links)
- Abandonment value in capital budeting: A mathematical programming approach (Q1088899) (← links)
- A note on solving quadratic programs using mixed-integer programming (Q1115803) (← links)
- Backtracking of jobs in one-dimensional machine location problems (Q1127161) (← links)
- Specialized inspection problems in serial production systems (Q1129930) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- Binary interactions and subset choice (Q1268247) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- Configuration of manufacturing software through capability specification and selection (Q1323732) (← links)
- Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
