Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
The mixing-MIR set with divisible capacities
by
Zhao, M.
, de Farias, I. R.
in
Algorithms
/ Applied sciences
/ Calculus of Variations and Optimal Control; Optimization
/ Combinatorics
/ Exact sciences and technology
/ Full Length Paper
/ Integer programming
/ Inventory control, production control. Distribution
/ Mathematical and Computational Physics
/ Mathematical Methods in Physics
/ Mathematical programming
/ Mathematics
/ Mathematics and Statistics
/ Mathematics of Computing
/ Numerical Analysis
/ Operational research and scientific management
/ Operational research. Management science
/ Optimization
/ Studies
/ Theoretical
/ Traveling salesman problem
2008
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The mixing-MIR set with divisible capacities
by
Zhao, M.
, de Farias, I. R.
in
Algorithms
/ Applied sciences
/ Calculus of Variations and Optimal Control; Optimization
/ Combinatorics
/ Exact sciences and technology
/ Full Length Paper
/ Integer programming
/ Inventory control, production control. Distribution
/ Mathematical and Computational Physics
/ Mathematical Methods in Physics
/ Mathematical programming
/ Mathematics
/ Mathematics and Statistics
/ Mathematics of Computing
/ Numerical Analysis
/ Operational research and scientific management
/ Operational research. Management science
/ Optimization
/ Studies
/ Theoretical
/ Traveling salesman problem
2008
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
The mixing-MIR set with divisible capacities
by
Zhao, M.
, de Farias, I. R.
in
Algorithms
/ Applied sciences
/ Calculus of Variations and Optimal Control; Optimization
/ Combinatorics
/ Exact sciences and technology
/ Full Length Paper
/ Integer programming
/ Inventory control, production control. Distribution
/ Mathematical and Computational Physics
/ Mathematical Methods in Physics
/ Mathematical programming
/ Mathematics
/ Mathematics and Statistics
/ Mathematics of Computing
/ Numerical Analysis
/ Operational research and scientific management
/ Operational research. Management science
/ Optimization
/ Studies
/ Theoretical
/ Traveling salesman problem
2008
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
The mixing-MIR set with divisible capacities
2008
Request Book From Autostore
and Choose the Collection Method
Overview
We study the set
, where
,
j
= 1, ...,
n
, and
B
1
| ... |
B
n
. The set
S
generalizes the mixed-integer rounding (MIR) set of Nemhauser and Wolsey and the mixing-MIR set of Günlük and Pochet. In addition, it arises as a substructure in general mixed-integer programming (MIP), such as in lot-sizing. Despite its importance, a number of basic questions about
S
remain unanswered, including the tractability of optimization over
S
and how to efficiently find a most violated cutting plane valid for
P
=
conv
(
S
). We address these questions by analyzing the extreme points and extreme rays of
P
. We give all extreme points and extreme rays of
P
. In the worst case, the number of extreme points grows exponentially with
n
. However, we show that, in some interesting cases, it is bounded by a polynomial of
n
. In such cases, it is possible to derive strong cutting planes for
P
efficiently. Finally, we use our results on the extreme points of
P
to give a polynomial-time algorithm for solving optimization over
S
.
Publisher
Springer-Verlag,Springer,Springer Nature B.V
Subject
/ Calculus of Variations and Optimal Control; Optimization
/ Exact sciences and technology
/ Inventory control, production control. Distribution
/ Mathematical and Computational Physics
/ Mathematical Methods in Physics
/ Operational research and scientific management
/ Operational research. Management science
/ Studies
This website uses cookies to ensure you get the best experience on our website.