Polylithic modeling and solution approaches using algebraic modeling systems
type: Item
instance of: scholarly article
title: Polylithic modeling and solution approaches using algebraic modeling systems
zbMATH Open document ID: 1259.90075
author: Josef Kallrath
published in: Optimization Letters
publication date: 2012-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6111702
zbMATH Keywords: algebraic modeling languages
zbMATH Keywords: branch and price
zbMATH Keywords: column generation
zbMATH Keywords: decomposition
zbMATH Keywords: hybrid methods
zbMATH Keywords: monolithic
zbMATH Keywords: primal methods
zbMATH Keywords: polylithic
zbMATH Keywords: problem-specific preprocessing
describes a project that uses: FEASPUMP
describes a project that uses: SAP APO
describes a project that uses: LINDO
describes a project that uses: LINGO
MaRDI profile type: Publication
full work available at URL: s11590-011-0320-4
OpenAlex ID: W1964815907
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Global optimization using special ordered sets
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Introduction to Stochastic Programming
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Decomposition Principle for Linear Programs
cites work: A generalized assignment problem with special ordered sets: a polyhedral approach.
cites work: A special ordered set approach for optimizing a discontinuous separable piecewise linear function
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
cites work: The feasibility pump
cites work: Local branching
cites work: Q4331736
cites work: A review of recent advances in global optimization
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Handbook of global optimization
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: Q3426040
cites work: A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
cites work: Global solution approach for a nonconvex MINLP problem in product portfolio optimization
cites work: Selected Topics in Column Generation
cites work: Piecewise-linear approximations of multidimensional functions
cites work: Production Planning by Mixed Integer Programming
cites work: Column enumeration based decomposition techniques for a class of non-convex MINLP problems
cites work: Bilinear modeling solution approach for fixed charge network flow problems
cites work: A branch and cut solver for the maximum stable set problem
cites work: A tutorial on branch and cut algorithms for the maximum stable set problem
cites work: Q3998364
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Q4891075
cites work: Solving planning and scheduling problems with combined integer and constraint programming
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
DOI: 10.1007/S11590-011-0320-4
description: scientific article; zbMATH DE number 6111702