Polylithic modeling and solution approaches using algebraic modeling systems
From MaRDI portal
Publication:691438
DOI10.1007/s11590-011-0320-4zbMath1259.90075OpenAlexW1964815907MaRDI QIDQ691438
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0320-4
decompositioncolumn generationhybrid methodsalgebraic modeling languagesbranch and pricemonolithicprimal methodspolylithicproblem-specific preprocessing
Related Items
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Minimal surface convex hulls of spheres, An incremental primal-dual method for nonlinear programming with special structure, Packing circles into perimeter-minimizing convex hulls, Packing ellipsoids into volume-minimizing rectangular boxes, Cutting ellipses from area-minimizing rectangles, JuMP: A Modeling Language for Mathematical Optimization, Near optimal minimal convex hulls of disks, High-Performance Prototyping of Decomposition Methods in GAMS, Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and cut solver for the maximum stable set problem
- Bilinear modeling solution approach for fixed charge network flow problems
- A review of recent advances in global optimization
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Piecewise-linear approximations of multidimensional functions
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Partitioning procedures for solving mixed-variables programming problems
- Handbook of global optimization
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Solving planning and scheduling problems with combined integer and constraint programming
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- The feasibility pump
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Introduction to Stochastic Programming
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Global optimization using special ordered sets
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Production Planning by Mixed Integer Programming
- A generalized assignment problem with special ordered sets: a polyhedral approach.
