Pages that link to "Item:Q3245699"

The following pages link to On the Solution of Discrete Programming Problems (Q3245699):

Displaying 49 items.

• Mathematical programming techniques in water network optimization (Q319201) (← links)
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
• Branch and bound, integer, and non-integer programming (Q537592) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• Mixed integer linear models for the optimization of dynamical transport networks (Q634782) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
• Alternating control tree search for knapsack/covering problems (Q972644) (← links)
• An approximate solution approach for a scenario-based capital budgeting model (Q993706) (← links)
• Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung (Q1217449) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Models for representing piecewise linear cost functions (Q1433660) (← links)
• Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
• Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
• An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
• A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
• On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
• Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing (Q2139148) (← links)
• Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
• The fractional multidimensional knapsack problem: solution and uniqueness (Q2157286) (← links)
• Models and solution techniques for production planning problems with increasing byproducts (Q2250099) (← links)
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
• Knapsack problems: a parameterized point of view (Q2419116) (← links)
• Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
• Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
• A matheuristic framework for the three-dimensional single large object placement problem with practical constraints (Q2664409) (← links)
• On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
• Exact and approximation algorithms for a soft rectangle packing problem (Q2926482) (← links)
• Validation of nominations in gas network optimization: models, methods, and solutions (Q2943808) (← links)
• Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← links)
• Convex Relaxations for Gas Expansion Planning (Q2960359) (← links)
• Outline of an algorithm for integer solutions to linear programs (Q3256638) (← links)
• Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis (Q3270232) (← links)
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
• Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (Q4972544) (← links)
• Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
• Mathematical programming applied to linear approximation of functions (Q5593543) (← links)
• Eine Erweiterung des Transportproblems (Q5650504) (← links)
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Optimization over decision trees: a case study for the design of stable direct-current electricity networks (Q6088547) (← links)
• Supervised homogeneity fusion: a combinatorial approach (Q6192329) (← links)