On the Solution of Discrete Programming Problems
From MaRDI portal
Publication:3245699
DOI10.2307/1907744zbMath0078.34005OpenAlexW2026994686WikidataQ96160692 ScholiaQ96160692MaRDI QIDQ3245699
Alan S. Manne, Harry M. Markowitz
Publication date: 1957
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1907744
Related Items
COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing, Mathematical programming techniques in water network optimization, Bi-dimensional knapsack problems with one soft constraint, Piecewise linear bounding functions in univariate global optimization, The fractional multidimensional knapsack problem: solution and uniqueness, Exact and approximation algorithms for a soft rectangle packing problem, Staircase compatibility and its applications in scheduling and piecewise linearization, A matheuristic framework for the three-dimensional single large object placement problem with practical constraints, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Validation of nominations in gas network optimization: models, methods, and solutions, Knapsack problems: a parameterized point of view, Structural Investigation of Piecewise Linearized Network Flow Problems, Optimization over decision trees: a case study for the design of stable direct-current electricity networks, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, Adaptive Bundle Methods for Nonlinear Robust Optimization, Eine Erweiterung des Transportproblems, Convex Relaxations for Gas Expansion Planning, Supervised homogeneity fusion: a combinatorial approach, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, Mixed integer linear models for the optimization of dynamical transport networks, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Outline of an algorithm for integer solutions to linear programs, Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis, The multidimensional 0-1 knapsack problem: an overview., Locally ideal formulations for piecewise linear functions with indicator variables, Incremental and encoding formulations for mixed integer programming, Models for representing piecewise linear cost functions, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Classical cuts for mixed-integer programming and branch-and-cut, Bringing order into the neighborhoods: Relaxation guided variable neighborhood search, Models and solution techniques for production planning problems with increasing byproducts, Branch and bound, integer, and non-integer programming, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Alternating control tree search for knapsack/covering problems, Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung, Mathematical programming applied to linear approximation of functions, An approximate solution approach for a scenario-based capital budgeting model, SCIP: solving constraint integer programs, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes, Mixed integer models for the stationary case of gas network optimization, 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, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
