Preface.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 17, doi. 10.1007/s10479-005-3441-2
- By:
- Publication type:
- Article
Works matching IS 02545330 AND DT 2005 AND VI 139 AND IP 1-4
Results: 15
1
2
Cover and Pack Inequalities for (Mixed) Integer Programming.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 21, doi. 10.1007/s10479-005-3442-1
- By:
- Publication type:
- Article
3
A Mixed-Integer Programming Model for Gas Purchase and Transportation.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 39, doi. 10.1007/s10479-005-3443-0
- By:
- Publication type:
- Article
4
Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 65, doi. 10.1007/s10479-005-3444-z
- By:
- Publication type:
- Article
5
Depth-Optimized Convexity Cuts.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 95, doi. 10.1007/s10479-005-3445-y
- By:
- Publication type:
- Article
6
Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 131, doi. 10.1007/s10479-005-3446-x
- By:
- Publication type:
- Article
7
About Lagrangian Methods in Integer Optimization.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 163, doi. 10.1007/s10479-005-3447-9
- By:
- Publication type:
- Article
8
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 195, doi. 10.1007/s10479-005-3448-8
- By:
- Publication type:
- Article
9
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 229, doi. 10.1007/s10479-005-3449-7
- By:
- Publication type:
- Article
10
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 243, doi. 10.1007/s10479-005-3450-1
- By:
- Publication type:
- Article
11
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 267, doi. 10.1007/s10479-005-3451-0
- By:
- Publication type:
- Article
12
A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 289, doi. 10.1007/s10479-005-3452-z
- By:
- Publication type:
- Article
13
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 321, doi. 10.1007/s10479-005-3453-y
- By:
- Publication type:
- Article
14
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 353, doi. 10.1007/s10479-005-3454-x
- By:
- Publication type:
- Article
15
On Compact Formulations for Integer Programs Solved by Column Generation.
- Published in:
- Annals of Operations Research, 2005, v. 139, n. 1-4, p. 375, doi. 10.1007/s10479-005-3455-9
- By:
- Publication type:
- Article