scientific article; zbMATH DE number 1312984
From MaRDI portal
Publication:4254875
zbMATH Open0930.90072MaRDI QIDQ4254875FDOQ4254875
Authors: Laurence A. Wolsey 
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)
- 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
- 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
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- 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?)
- Intermediate integer programming representations using value disjunctions
- 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
- On solving manufacturing cell formation via bicluster editing
- Robust optimisation of green wireless LANs under rate uncertainty and user mobility
- Using and extending fix-and-relax to solve maritime inventory routing problems
- A two-stage stochastic mixed-integer programming approach to the index tracking problem
- Connectivity-and-hop-constrained design of electricity distribution networks
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- A tactical model for planning the production and distribution of fresh produce
- Integrated rolling stock deadhead routing and timetabling in urban rail transit lines
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Stronger instruments via integer programming in an observational study of late preterm birth outcomes
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- On mixing sets arising in chance-constrained programming
- A cutting plane algorithm for graph coloring
- A branch-and-cut algorithm for graph coloring
- Column generation extensions of set covering greedy heuristics
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- A new approximation hierarchy for polynomial conic optimization
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
- An analytical approach to the protection planning of a rail intermodal terminal network
- Rounding-based heuristics for nonconvex MINLPS
- A new model and hybrid approach for large scale inventory routing problems
- On the asymmetric representatives formulation for the vertex coloring problem
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Circulation of railway rolling stock: a branch-and-price approach
- Supersparse linear integer models for optimized medical scoring systems
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
- Airport management: taxi planning
- A note on the separation of subtour elimination constraints in elementary shortest path problems
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Solving the electricity production planning problem by a column generation based heuristic
- Mathematical models of the bandpass problem and OrderMatic computer game
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- Topology design of tensegrity structures via mixed integer programming
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Scheduling satellite launch missions: an MILP approach
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Minimizing value-at-risk in single-machine scheduling
- Progress in presolving for mixed integer programming
- Constrained target controllability of complex networks
- Modeling forest core area with integer programming
- A Lagrange relaxation method for solving weapon-target assignment problem
- Optimal selection of forest patches using integer and fractional programming
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
- Information-theoretic approaches to branching in search
- Optimized assignment patterns in mobile edge cloud networks
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)
