scientific article; zbMATH DE number 1312984
From MaRDI portal
Publication:4254875
zbMath0930.90072MaRDI QIDQ4254875
Publication date: 1 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Cutting-plane-based algorithms for two branch vertices related spanning tree problems, Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation, Dissecting the duality gap: the supporting hyperplane interpretation revisited, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, A combinatorial optimization approach to scenario filtering in portfolio selection, An iterative heuristic for passenger-centric train timetabling with integrated adaption times, Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness, The multiple Steiner TSP with order constraints: complexity and optimization algorithms, Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families, Robust min-max regret covering problems, Shattering inequalities for learning optimal decision trees, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Feeder routing for air-to-air refueling operations, A theoretical justification of the set covering greedy heuristic of Caprara et al., A transformation-proximal bundle algorithm for multistage adaptive robust optimization and application to constrained robust optimal control, Optimal collection of medical specimens and delivery to central laboratory, An overview of MINLP algorithms and their implementation in Muriqui optimizer, A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, Integer linear programming models for grid-based light post location problem, Mixed-integer optimization methods for online scheduling in large-scale HVAC systems, Enhancing discretized formulations: the knapsack reformulation and the star reformulation, Could we use a million cores to solve an integer program?, Particle filter-based data assimilation technique for the evaluation of transport of pollutants in small rivers, Stronger instruments via integer programming in an observational study of late preterm birth outcomes, Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty, Global optimization for a class of nonlinear sum of ratios problem, Strategic planning of an underground mine with variable cut-off grades, Sharp bounds for the second-order general connectivity index of hexagonal chains, The rank pricing problem: models and branch-and-cut algorithms, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach, A note on maximal covering location games, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Optimized assignment patterns in mobile edge cloud networks, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Location routing problems on trees, A stochastic optimization approach to shift scheduling with breaks adjustments, Decomposition methods for the two-stage stochastic Steiner tree problem, Integrated facility location and capacity planning under uncertainty, Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs, A branch-and-price algorithm for a vehicle routing with demand allocation problem, Robust decision making using a general utility set, The separation problem of rounded capacity inequalities: some polynomial cases, On the complexity of the separation problem for rounded capacity inequalities, Regenerator location problem: polyhedral study and effective branch-and-cut algorithms, Convex hull representation of the deterministic bipartite network interdiction problem, An analytical approach to the protection planning of a rail intermodal terminal network, Optimal pathway reconstruction on 3D NMR maps, Algorithmic expedients for the \(S\)-labeling problem, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, A hybrid differential evolution algorithm with column generation for resource constrained job scheduling, Lagrangian relaxation and constraint generation for allocation and advanced scheduling, A Davidson college multi-objective assignment problem: a case study, Heuristic solutions to the long-term unit commitment problem with cogeneration plants, Shift-and-merge technique for the DP solution of the time-constrained backpacker problem, Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling, Rounding-based heuristics for nonconvex MINLPS, A first look at picking dual variables for maximizing reduced cost fixing, Putting continuous metaheuristics to work in binary search spaces, Evaluating the impact of AND/OR search on 0-1 integer linear programming, Convex reformulation for binary quadratic programming problems via average objective value maximization, Exact solution of the soft-clustered vehicle-routing problem, Mixed integer formulations for a routing problem with information collection in wireless networks, Bi-objective scheduling on a restricted batching machine, Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, Machine learning for combinatorial optimization: a methodological tour d'horizon, Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties, Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure, A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming, Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria, An integer programming approach for solving a generalized version of the Grundy domination number, Efficient generation of performance bounds for a class of traffic scheduling problems, Random sampling and machine learning to understand good decompositions, Valuing portfolios of interdependent real options using influence diagrams and simulation-and-regression: a multi-stage stochastic integer programming approach, The time buffer approximated buffer allocation problem: a row-column generation approach, Matheuristic for the decentralized factories scheduling problem, Black-box combinatorial optimization using models with integer-valued minima, Modeling formulation and a new heuristic for the railroad blocking problem, Efficient formulations for the traveling car renter problem and its quota variant, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture, A bi-integrated model for coupling lot-sizing and cutting-stock problems, Worst case analysis of relax and fix heuristics for lot-sizing problems, Distributionally robust optimization. A review on theory and applications, Integrated rolling stock deadhead routing and timetabling in urban rail transit lines, Parametric convex quadratic relaxation of the quadratic knapsack problem, Strong bounds for resource constrained project scheduling: preprocessing and cutting planes, A branch-and-cut algorithm for the capacitated profitable tour problem, Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction, Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction, Column generation extensions of set covering greedy heuristics, Quantile lower bounds to reliability based on locally optimal splits, Branch-and-refine for solving time-expanded MILP formulations, A subsidy policy to managing hazmat risk in railroad transportation network, A note on the separation of subtour elimination constraints in elementary shortest path problems, Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, Searching multiregression dynamic models of resting-state fMRI networks using integer programming, Polynomial invariants for arbitrary rank \(D\) weakly-colored stranded graphs, Solving the minimum convex partition of point sets with integer programming, MMC techniques for limited dependent variables models: implementation by the branch-and-bound algorithm, Integer programming techniques for the nurse rostering problem, Dynamic resource allocation problem for transportation network evacuation, Accurate optimization models for interference constrained bandwidth allocation in cellular networks, Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming, Optimization-based heuristics for underground mine scheduling, Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm, Local convex hulls for a special class of integer multicommodity flow problems, On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems, An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, MIR closures of polyhedral sets, Two-phase branch-and-cut for the mixed capacitated general routing problem, A parallelised distributed implementation of a branch and fix coordination algorithm, Valid inequalities for the synchronization bus timetabling problem, An exact decomposition algorithm for the generalized knapsack sharing problem, On solving manufacturing cell formation via bicluster editing, Robust optimisation of green wireless LANs under rate uncertainty and user mobility, Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem, Theoretical challenges towards cutting-plane selection, A fix-and-optimize heuristic for the high school timetabling problem, Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, Capacity expansion of stochastic power generation under two-stage electricity markets, Minimizing average project team size given multi-skilled workers with heterogeneous skill levels, The green capacitated multi-item lot sizing problem with parallel machines, Lagrangian and branch-and-cut approaches for upgrading spanning tree problems, Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations, A relax-and-cut framework for large-scale maximum weight connected subgraph problems, Scheduling pumpoff operations in onshore oilfields with electric-power constraints and variable cycle time, Redundancy system design for an aircraft door management system, Solution methods for the tray optimization problem, Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain, The dynamic vehicle allocation problem with application in trucking companies in Brazil, Using and extending fix-and-relax to solve maritime inventory routing problems, A multi-shift vehicle routing problem with windows and cycle times, Maximizing system lifetime in wireless sensor networks, Maximum margin semi-supervised learning with irrelevant data, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, Integer linear programming approaches for non-unique probe selection, Unit commitment in oligopolistic markets by nonlinear mixed variable programming, A two-stage stochastic mixed-integer programming approach to the index tracking problem, A primal-dual backtracking optimization method for blended composite structures, Extended formulation for hop constrained distribution network configuration problems, Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints, New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach, Scheduling satellite launch missions: an MILP approach, A matheuristic for the asymmetric capacitated vehicle routing problem, Another pedagogy for mixed-integer Gomory, Multi-level single machine lot-sizing and scheduling with zero lead times, Heuristic and exact algorithms for a min-max selective vehicle routing problem, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, A Lagrange relaxation method for solving weapon-target assignment problem, A survey of the standard location-routing problem, Progress in presolving for mixed integer programming, Information-theoretic approaches to branching in search, On a generalization of ``eight blocks to madness puzzle, Convex hulls of superincreasing knapsacks and lexicographic orderings, A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems, Connectivity-and-hop-constrained design of electricity distribution networks, A frontier-based system of incentives for units in organisations with varying degrees of decentralisation, Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches., A parametric branch and bound approach to suboptimal explicit hybrid MPC, Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry, Forestry management under uncertainty, Modeling forest core area with integer programming, A tactical model for planning the production and distribution of fresh produce, A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, An efficient algorithm for solving convex-convex quadratic fractional programs, Supersparse linear integer models for optimized medical scoring systems, A branch and cut heuristic for a runway scheduling problem, An algorithmic framework for convex mixed integer nonlinear programs, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Minimizing value-at-risk in single-machine scheduling, Synergistic modeling of call center operations, Topology design of tensegrity structures via mixed integer programming, On the incorporation of adversarial reasoning in course of action analysis and resource allocation, An anytime deduction algorithm for the probabilistic logic and entailment problems, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, Modeling with discrete-time recurrent fuzzy systems via mixed-integer optimization, Optimal selection of forest patches using integer and fractional programming, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Mathematical models of the bandpass problem and OrderMatic computer game, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, An efficient Lagrangean heuristic for rental vehicle scheduling, Optimal wafer cutting in shuttle layout problems, Detecting critical nodes in sparse graphs, Tight MIP formulations of the power-based unit commitment problem, An inexact bundle variant suited to column generation, A general quantity discount and supplier selection mixed integer programming model, Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems, On earliest deadline first scheduling for temporal consistency maintenance, An iterative approach to robust and integrated aircraft routing and crew scheduling, Integer-programming software systems, Solving planning and design problems in the process industry using mixed integer and global optimization, Global optimization of objective functions represented by ReLU networks, Matheuristics: survey and synthesis, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic, Learning monotone preferences using a majority rule sorting model, A recombination‐based matheuristic for mixed integer programming problems with binary variables, A new formulation for the liner shipping network design problem, An integer linear programming approach to solving the Eternity puzzle, Solving Steiner trees: Recent advances, challenges, and perspectives, Weighted target set selection on trees and cycles, A Lagrangean relaxation approach to lifetime maximization of directional sensor networks, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management, Limiting flexibility in nonparametric efficiency evaluations: an ex post \(k\)-centroid clustering approach, Analytical Problem Solving Based on Causal, Correlational and Deductive Models, Liner Shipping Cargo Allocation with Repositioning of Empty Containers, A survey on mixed-integer programming techniques in bilevel optimization, A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones, An integer linear programming model for tilings, Methods for the graph realization problem, Pipeline network design for gathering unconventional oil and gas production using mathematical optimization, A strongly polynomial algorithm for the minimum maximum flow degree problem, An efficient mixed integer linear programming model for the minimum spanning tree problem, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, Economic lot sizing problem with tank scheduling, Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty, Comparative analysis of linear programming relaxations for the robust knapsack problem, Valid inequalities and facets for multi‐module survivable network design problem, When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation, Classical cuts for mixed-integer programming and branch-and-cut, Constraint programming-based column generation, Constraint programming-based column generation, Solving the hub location problem in a star–star network, A multi-period network design problem for cellular telecommunication systems, Cyclic preference scheduling for nurses using branch and price, The omnipresence of Lagrange, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Lagrangian heuristics for the quadratic knapsack problem, A MEAN-VARIANCE-SKEWNESS MODEL: ALGORITHM AND APPLICATIONS, Strong Formulations for 2-Node-Connected Steiner Network Problems, A genetic algorithm applied to optimal allocation in stratified sampling, An Exact Algorithm for the Steiner Tree Problem with Delays, An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization, Shortest-path network interdiction, An exact algorithm for the budget-constrained multiple knapsack problem, Polyhedral aspects of score equivalence in Bayesian network structure learning, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Subadditive approaches in integer programming, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, MINLP Application for ACH Interiors Restructuring, Exact estimation of multiple directed acyclic graphs, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, Path inequalities for the vehicle routing problem with time windows, A Branch-and-Price Algorithm for the Multiple Knapsack Problem, Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach, Enumerating Integer Points in Polytopes with Bounded Subdeterminants, Circulation of railway rolling stock: a branch-and-price approach, Optimization in Designing Complex Communication Networks, Mathematical programming approaches for dual multicast routing problem with multilayer risk cost, A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints, Lexicographical order in integer programming, Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem, Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm, Reinforcement learning for combinatorial optimization: a survey, A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts, A column generation tailored to electric vehicle routing problem with nonlinear battery depreciation, Discrete multi-module capacitated lot-sizing problems with multiple items, A rolling-horizon approach for multi-period optimization, Decomposition Branching for Mixed Integer Programming, Parallelization of the FICO Xpress-Optimizer, A cut-and-branch algorithm for the quadratic knapsack problem, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers, A new approximation hierarchy for polynomial conic optimization, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION, A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging, The Capacitated and Economic Districting Problem, Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, Optimal Migration Planning of Telecommunication Equipment, Structural Identifiability in Low-Rank Matrix Factorization, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, On mixing sets arising in chance-constrained programming, Pattern search in the presence of degenerate linear constraints, Solving the electricity production planning problem by a column generation based heuristic, LS-LIB: A Library of Tools for Solving Production Planning Problems, Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs, Optimization Models in the Natural Gas Industry, Extension of model-based classification for binary data when training and test populations differ, Polyhedral approaches to learning Bayesian networks, Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems, A branch-and-price algorithm for a targeting problem, Constrained target controllability of complex networks, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos, A cutting plane algorithm for graph coloring, A MAXIMAL PREDICTABILITY PORTFOLIO SUBJECT TO A TURNOVER CONSTRAINT, Symmetric ILP: Coloring and small integers, AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM, Dynamic programming and lower-bound approaches to the minimum binding problem, Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems, On the asymmetric representatives formulation for the vertex coloring problem, A new model and hybrid approach for large scale inventory routing problems, Detecting infeasibility and generating cuts for mixed integer programming using constraint programming, A branch-and-cut algorithm for graph coloring, Short-term harvest planning including scheduling of harvest crews, LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm, Network design arc set with variable upper bounds, Joint optimization of pricing and resource allocation in competitive telecommunications networks, Solving a class of stochastic mixed-integer programs with branch and price, Integer Programming for Classifying Orthogonal Arrays, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Airport management: taxi planning, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, Upper and lower bounding procedures for the multiple knapsack assignment problem, A trust-region-based derivative free algorithm for mixed integer programming, A simple effective heuristic for embedded mixed-integer quadratic programming, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Exact algorithms for scheduling multiple families of jobs on parallel machines, Multi-Product Inventory Logistics Modeling in the Process Industries, Adaptive two-stage optimal designs for phase II clinical studies that allow early futility stopping, Graphs and Algorithms in Communication Networks on Seven League Boots, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems, Optimization of OSPF Routing in IP Networks, A hybrid multicommodity routing algorithm for traffic engineering, A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem, The minimum cut cover problem, Polyhedral Results and Branch-and-Cut for the Resource Loading Problem, Exploiting Symmetries in Polyhedral Computations, A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING, Towards a Computationally Tractable Maximum Entropy Principle for Nonstationary Financial Time Series, A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities, COLUMN GENERATION APPROACH TO LINE PLANNING WITH VARIOUS HALTING PATTERNS — APPLICATION TO THE KOREAN HIGH-SPEED RAILWAY, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, Simple lifted cover inequalities and hard knapsack problems
