Partitioning procedures for solving mixed-variables programming problems

From MaRDI portal

Publication:1131201

Jump to:navigation, search

DOI10.1007/BF01386316zbMath0109.38302WikidataQ89256191 ScholiaQ89256191MaRDI QIDQ1131201

J. F. Benders

Publication date: 1962

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131533

zbMATH Keywords

applications of probability theory and statistics

Related Items

A convergence proof for linear mean value cross decomposition, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme, Test problems in stochastic multistage programming, LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS, A survey on Benders decomposition applied to fixed-charge network design problems, A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem, Mixed integer programming for a special logic constrained optimal control problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, Hierarchical design of an integrated production and 2-echelon distribution system, Stepwise decomposition approaches for large scale cell formation problems, Exact solution methods for uncapacitated location problems with convex transportation costs, A demand-shifting feasibility algorithm for Benders decomposition., An extended enterprise planning methodology for the discrete manufacturing industry, An algorithm for optimizing network flow capacity under economies of scale, Characterization of local solutions for a class of nonconvex programs, Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms, A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors, Network planning under uncertainty with an application to hydropower generation, Epigraphical nesting: A unifying theory for the convergence of algorithms, Refinery units maintenance scheduling using integer programming, Efficient decomposition and linearization methods for the stochastic transportation problem, Parallel decomposition of large-scale stochastic nonlinear programs, Feasibility in uncapacitated networks: The effect of individual arcs and nodes, Packing Steiner trees: A cutting plane algorithm and computational results, Long range planning in the process industries: A projection approach, A cutting plane method from analytic centers for stochastic programming, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, The multi-layered network design problem, Solving dynamic stochastic economic models by mathematical programming decomposition methods, Solving a capacitated hub location problem, Application of Benders' decomposition to power plant preventive maintenance scheduling, Dynamic supply chain design with inventory, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, Primal partition programming for block diagonal matrices, The workload balancing problem at air cargo terminals, Benders decomposition for a class of variational inequalities, Constraint-based optimization and utility elicitation using the minimax decision criterion, Biconvex sets and optimization with biconvex functions: a survey and extensions, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Using mixed-integer programming to solve power grid blackout problems, Portfolio selection with divisible and indivisible assets: mathematical algorithm and economic analysis, A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes, A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, A stochastic programming approach for supply chain network design under uncertainty, A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems, A constraint generation algorithm for large scale linear programs using multiple-points separation, SPAR: Stochastic Programming with Adversarial Recourse, Solving a class of stochastic mixed-integer programs with branch and price, On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables, A Benders decomposition approach for the robust spanning tree problem with interval data, A new approach based on the surrogating method in the project time compression problems, A management system for decompositions in stochastic programming, Simultaneous fleet assignment and cargo routing using Benders decomposition, A decomposition method for structured quadratic programming problems, A decomposition method for structured linear and nonlinear programs, Optimization of large-scale systems, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, Generalized Benders decomposition, A mixed integer programming model for scheduling orders in a steel mill, Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues, Duality in mathematics and linear and integer programming, Cutting plane method for multiple objective stochastic integer linear programming, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, A decomposition approach for global optimum search in QP, NLP and MINLP problems, The application of generalized Benders decomposition to certain nonconcave programs, An integrated plant loading model with economies of scale and scope, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions, Sequential approach to the solution of mixed linear programs, A method for decomposing mixed-integer linear programs with staircase structure, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire, A Structure Conveying Parallelizable Modeling Language for Mathematical Programming, Decentralization model with flexible multi-goals and concessions, Concave minimization under linear constraints with special structure, The method of double truncation in the decomposition of large-scale problems, Solving multiple criteria problems by interactive decomposition, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Nested decomposition of multistage nonlinear programs with recourse, A piecewise linear upper bound on the network recourse function, Pickup and Delivery of Partial Loads with “Soft” Time Windows, Revised dantzig-wolfe decomposition for staircase-structured linear programs, Models and methods of solution of quadratic integer programming problems, On the interactive solution to a multicriteria scheduling problem, The use of relaxation techniques to solve certain mathematical decision‐making problems, Two stage linear programming under uncertainty with 0–1 integer first stage variables, Unnamed Item, Integer programming duality: Price functions and sensitivity analysis, An elementary survey of general duality theory in mathematical programming, Mixed-integer quadratic programming, Solving partially integer-valued optimization problems which are convex relative to a continuous variable, Topological design of centralized computer networks—formulations and algorithms, Unnamed Item, Break minimization, Improved penalty calculations for a mixed integer branch-and-bound algorithm, Unnamed Item, Decomposition of arborescent linear programs, Piecewise convex programs, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, Integrated model for supplier selection and negotiation in a make-to-order environment, Cross decomposition for mixed integer programming, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Beiträge zur Dekomposition von linearen Programmen, Résolution des programmes linéaires a variables mixtes par la procédure S.E.P., Integrating operations research in constraint programming, Optimal cropping patterns under water deficits., Multistage quadratic stochastic programming, Automatic test data generation for path testing using GAs, Mathematical programming and electricity markets. (With comments and rejoinder), An efficient procedure for the N-city traveling salesman problem, A Benders decomposition based heuristic for the hierarchical production planning problem, A branch and bound algorithm for the capacitated vehicle routing problem, Using central prices in the decomposition of linear programs, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Mixed-integer bilinear programming problems, The integer \(L\)-shaped method for stochastic integer programs with complete recourse, Decomposition in general mathematical programming, Bounding multi-stage stochastic programs from above, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Parallel processors for planning under uncertainty, On the convergence of cross decomposition, The mixed postman problem, Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm, Large-scale mixed integer programming: Benders-type heuristics, Constructive characterizations of the value-function of a mixed-integer program. I, Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung, Global optimization algorithms for linearly constrained indefinite quadratic problems, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, Multi-period near-equilibrium in a pool-based electricity market including on/off decisions, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints, About Lagrangian methods in integer optimization, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Logical processing for integer programming, A generic stochastic model for supply-and-return network design, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Identifying and exploiting problem structures using explanation-based constraint programming, A Benders decomposition algorithm for base station planning problem in WCDMA networks, An integrated model for logistics network design, An integrated aircraft routing, crew scheduling and flight retiming model, Designing cost-effective content distribution networks, On a stochastic sequencing and scheduling problem, A branch-and-cut algorithm for the continuous error localization problem in data cleaning, On the enrouting protocol problem under uncertainty, Integer programming models for the \(q\)-mode problem, Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches, A note on Benders' decomposition in mixed-integer quadratic programming, Benders' decomposition for the constrained \(\ell_ 1\)-problem, MSLiP: A computer code for the multistage stochastic linear programming problem, On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, Equilibrium prices supported by dual price functions in markets with non-convexities, Benders decomposition for the uncapacitated multiple allocation hub location problem, Integrated airline scheduling, Computing robust basestock levels, Hedging options under transaction costs and stochastic volatility, A two-stage stochastic programming model for transportation network protection, A comparative study of decomposition algorithms for stochastic combinatorial optimization, Practical enhancements to the Magnanti-Wong method, Bender's method revisited, Solving embedded generalized network problems, Capital budgeting with Benders' decomposition, Constructive characterizations of the value function of a mixed-integer program. II, Facility location models for distribution planning, Symmetric duality for disjunctive programming with absolute value functionals, Refining bounds for stochastic linear programs with linearly transformed independent random variables, Local decomposition methods for linear programming, A multicut algorithm for two-stage stochastic linear programs, Strong formulations for mixed integer programming: A survey, Cutting planes and column generation techniques with the projective algorithm, Experiments in integer programming, Investments in stochastic maximum flow networks, Optimality tests for partitioning and sectional search algorithms, Multi-stage stochastic optimization applied to energy planning, Decomposition in global optimization, The vehicle routing problem: An overview of exact and approximate algorithms, Linear mean value cross decomposition: A generalization of the Kornai- Liptak method, A decomposition technique for mixed integer programming problems, Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs, The value function of a mixed integer program: I, An algorithm for the quadratic assignment problem using Benders' decomposition, Unilateral contact, elastoplasticity and complementarity with reference to offshore pipeline design, Hedging exotic derivatives through stochastic optimization, A robustness approach to uncapacitated network design problems, Mean value cross decomposition applied to integer programming problems, Intelligent control and optimization under uncertainty with application to hydro power, MIP modelling of changeovers in production planning and scheduling problems, Using an interior point method for the master problem in a decomposition approach, Optimal solution of cellular manufacturing system design: Bender's decomposition approach, Stabilized column generation, Exact solution of multicommodity network optimization problems with general step cost functions, Multi-stage stochastic linear programs for portfolio optimization, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, A set covering reformulation of the pure fixed charge transportation problem, Data parallel computing for network-structured optimization problems, Dynamic factorization in large-scale optimization, Utility least cost planning and the Washington gas integrated model, On using approximations of the Benders master problem, Solving the staircase cost facility location problem with decomposition and piecewise linearization, A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, Duality and statistical tests of optimality for two stage stochastic programs, Decomposition methods in stochastic programming, A number theoretic reformulation and decomposition method for integer programming, Distributed decision making----a unified approach., BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1131201&oldid=13182480"