scientific article; zbMATH DE number 1312984
From MaRDI portal
Publication:4254875
zbMATH Open0930.90072MaRDI QIDQ4254875FDOQ4254875
Publication date: 1 July 1999
Title of this publication is not available (Why is that?)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (only showing first 100 items - show all)
- Branch-and-refine for solving time-expanded MILP formulations
- Strategic planning of an underground mine with variable cut-off grades
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups
- Exact solution of the soft-clustered vehicle-routing problem
- Algorithmic expedients for the \(S\)-labeling problem
- A hybrid differential evolution algorithm with column generation for resource constrained job scheduling
- A subsidy policy to managing hazmat risk in railroad transportation network
- Dissecting the duality gap: the supporting hyperplane interpretation revisited
- Particle filter-based data assimilation technique for the evaluation of transport of pollutants in small rivers
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Exploiting Symmetries in Polyhedral Computations
- Random sampling and machine learning to understand good decompositions
- Mixed integer formulations for a routing problem with information collection in wireless networks
- Towards a Computationally Tractable Maximum Entropy Principle for Nonstationary Financial Time Series
- Convex hull representation of the deterministic bipartite network interdiction problem
- Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
- Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties
- 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
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- An integer programming approach for solving a generalized version of the Grundy domination number
- The time buffer approximated buffer allocation problem: a row-column generation approach
- Simple majority rule and integer programming
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Optimal Migration Planning of Telecommunication Equipment
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- Efficient formulations for the traveling car renter problem and its quota variant
- Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm
- A cut-and-branch algorithm for the quadratic knapsack problem
- Learning monotone preferences using a majority rule sorting model
- Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway
- Shattering inequalities for learning optimal decision trees
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- An exact algorithm for the budget-constrained multiple knapsack problem
- A survey on mixed-integer programming techniques in bilevel optimization
- 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
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Optimal collection of medical specimens and delivery to central laboratory
- Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems
- Mixed-integer optimization methods for online scheduling in large-scale HVAC systems
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- Distributionally robust optimization. A review on theory and applications
- Valuing portfolios of interdependent real options using influence diagrams and simulation-and-regression: a multi-stage stochastic integer programming approach
- A combinatorial optimization approach to scenario filtering in portfolio selection
- Title not available (Why is that?)
- Weighted target set selection on trees and cycles
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Quantile lower bounds to reliability based on locally optimal splits
- Polyhedral Results and Branch-and-Cut for the Resource Loading Problem
- Title not available (Why is that?)
- A trust-region-based derivative free algorithm for mixed integer programming
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Polynomial invariants for arbitrary rank \(D\) weakly-colored stranded graphs
- MMC techniques for limited dependent variables models: implementation by the branch-and-bound algorithm
- Parallelization of the FICO Xpress-Optimizer
- The omnipresence of Lagrange
- An algorithmic framework for convex mixed integer nonlinear programs
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Integer programming techniques for the nurse rostering problem
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- Optimization-based heuristics for underground mine scheduling
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Cyclic preference scheduling for nurses using branch and price
- Integer-programming software systems
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Detecting critical nodes in sparse graphs
- Dynamic resource allocation problem for transportation network evacuation
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Shortest-path network interdiction
- Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm
- Local convex hulls for a special class of integer multicommodity flow problems
- A fix-and-optimize heuristic for the high school timetabling problem
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- Extension of model-based classification for binary data when training and test populations differ
- A MEAN-VARIANCE-SKEWNESS MODEL: ALGORITHM AND APPLICATIONS
- Title not available (Why is that?)
- Constraint programming-based column generation
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- A parallelised distributed implementation of a branch and fix coordination algorithm
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Path inequalities for the vehicle routing problem with time windows
- Maximizing system lifetime in wireless sensor networks
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Solving the hub location problem in a star–star network
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Title not available (Why is that?)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Solving planning and design problems in the process industry using mixed integer and global optimization
- A branch-and-cut algorithm for the capacitated profitable tour problem
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Valid inequalities for the synchronization bus timetabling problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254875)
