scientific article; zbMATH DE number 1312984
From MaRDI portal
Publication:4254875
Recommendations
Cited in
(only showing first 100 items - show all)- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- Mathematical models of the bandpass problem and OrderMatic computer game
- Classical cuts for mixed-integer programming and branch-and-cut
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Solving the electricity production planning problem by a column generation based heuristic
- Synergistic modeling of call center operations
- Solving the minimum convex partition of point sets with integer programming
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
- Topology design of tensegrity structures via mixed integer programming
- Exploiting symmetries in polyhedral computations
- A trust-region-based derivative free algorithm for mixed integer programming
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- Discrete multi-module capacitated lot-sizing problems with multiple items
- scientific article; zbMATH DE number 710403 (Why is no real title available?)
- A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty
- Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Scheduling satellite launch missions: an MILP approach
- Towards a computationally tractable maximum entropy principle for nonstationary financial time series
- 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
- A note on maximal covering location games
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- A multi-period network design problem for cellular telecommunication systems
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- A strongly polynomial algorithm for the minimum maximum flow degree problem
- Minimizing value-at-risk in single-machine scheduling
- Progress in presolving for mixed integer programming
- An integer linear programming model for tilings
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Modeling forest core area with integer programming
- A Lagrange relaxation method for solving weapon-target assignment problem
- Tight second stage formulations in two-stage stochastic mixed integer programs
- On the incorporation of adversarial reasoning in course of action analysis and resource allocation
- Robust decision making using a general utility set
- Large-Scale Integer Programs in Image Analysis
- Constrained target controllability of complex networks
- Modeling with discrete-time recurrent fuzzy systems via mixed-integer optimization
- Branch-and-refine for solving time-expanded MILP formulations
- On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management
- Network design arc set with variable upper bounds
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Polynomial invariants for arbitrary rank D weakly-colored stranded graphs
- MMC techniques for limited dependent variables models: implementation by the branch-and-bound algorithm
- A new approach to select the best subset of predictors in linear regression modelling: bi-objective mixed integer linear programming
- Global optimization for a class of nonlinear sum of ratios problem
- Strategic planning of an underground mine with variable cut-off grades
- scientific article; zbMATH DE number 4045478 (Why is no real title available?)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Parallelization of the FICO Xpress-Optimizer
- An Exploratory Study for Identifying and Implementing Concerns in Integer Programming
- 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
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- A subsidy policy to managing hazmat risk in railroad transportation network
- Dissecting the duality gap: the supporting hyperplane interpretation revisited
- Optimal selection of forest patches using integer and fractional programming
- Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
- Ahybrid model (MILP-CLP) to pipeline operational scheduling
- An algorithmic framework for convex mixed integer nonlinear programs
- scientific article; zbMATH DE number 47668 (Why is no real title available?)
- An efficient Lagrangean heuristic for rental vehicle scheduling
- The Capacitated and Economic Districting Problem
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- Methods for the graph realization problem
- Particle filter-based data assimilation technique for the evaluation of transport of pollutants in small rivers
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Integer programming techniques for the nurse rostering problem
- Optimization-based heuristics for underground mine scheduling
- Location routing problems on trees
- An improved interior-point cutting-plane method for binary quadratic optimization
- The omnipresence of Lagrange
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
- Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- Information-theoretic approaches to branching in search
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- Integer programming for media streams planning problem
- A genetic algorithm applied to optimal allocation in stratified sampling
- Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
- A first look at picking dual variables for maximizing reduced cost fixing
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Optimized assignment patterns in mobile edge cloud networks
- Integer-programming software systems
- Simple lifted cover inequalities and hard knapsack problems
- An efficient mixed integer linear programming model for the minimum spanning tree problem
- A stochastic optimization approach to shift scheduling with breaks adjustments
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- Layering strategies for creating exploitable structure in linear and integer programs
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)
