On the Solution of Discrete Programming Problems
From MaRDI portal
Cited in
(51)- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Models for representing piecewise linear cost functions
- Bi-dimensional knapsack problems with one soft constraint
- Staircase compatibility and its applications in scheduling and piecewise linearization
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing
- Piecewise linear bounding functions in univariate global optimization
- The fractional multidimensional knapsack problem: solution and uniqueness
- Models and solution techniques for production planning problems with increasing byproducts
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Knapsack problems: a parameterized point of view
- Locally ideal formulations for piecewise linear functions with indicator variables
- Incremental and encoding formulations for mixed integer programming
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Mixed integer models for the stationary case of gas network optimization
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
- Exact and approximation algorithms for a soft rectangle packing problem
- Validation of nominations in gas network optimization: models, methods, and solutions
- Structural investigation of piecewise linearized network flow problems
- Convex relaxations for gas expansion planning
- Mathematical programming techniques in water network optimization
- Outline of an algorithm for integer solutions to linear programs
- Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Branch and bound, integer, and non-integer programming
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Mathematical programming applied to linear approximation of functions
- Eine Erweiterung des Transportproblems
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- Classical cuts for mixed-integer programming and branch-and-cut
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks
- Supervised homogeneity fusion: a combinatorial approach
- Mixed integer linear models for the optimization of dynamical transport networks
- An approximate dynamic programming approach for multi-stage stochastic lot-sizing under a decision-hazard-decision information structure
- Modeling bidirectional flows in gas networks
- SCIP: solving constraint integer programs
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Alternating control tree search for knapsack/covering problems
- An approximate solution approach for a scenario-based capital budgeting model
This page was built for publication: On the Solution of Discrete Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3245699)
