scientific article; zbMATH DE number 1312984
From MaRDI portal
Publication:4254875
Recommendations
Cited in
(only showing first 100 items - show all)- Detecting critical nodes in sparse graphs
- 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
- Layering strategies for creating exploitable structure in linear and integer programs
- Computational integer programming
- Integer optimization by local search. A domain-independent approach
- General purpose heuristics for integer programming. I
- Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches.
- 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
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem
- Theoretical challenges towards cutting-plane selection
- 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
- Maximum margin semi-supervised learning with irrelevant data
- Extended formulation for hop constrained distribution network configuration problems
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- A matheuristic for the asymmetric capacitated vehicle routing problem
- Another pedagogy for mixed-integer Gomory
- A survey of the standard location-routing problem
- A frontier-based system of incentives for units in organisations with varying degrees of decentralisation
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
- Global optimization for a class of nonlinear sum of ratios problem
- 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
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- Robust decision making using a general utility set
- Integer programming as projection
- 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
- An analytical approach to the protection planning of a rail intermodal terminal network
- Integer programming for urban design
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- 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
- Rounding-based heuristics for nonconvex MINLPS
- Bi-objective scheduling on a restricted batching machine
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- Dual network bounds for integer programming problems of a special form
- Application of regular partitions in integer programming
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Integer linear programming models for grid-based light post location problem
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Could we use a million cores to solve an integer program?
- Stronger instruments via integer programming in an observational study of late preterm birth outcomes
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- 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
- A first look at picking dual variables for maximizing reduced cost fixing
- Putting continuous metaheuristics to work in binary search spaces
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- 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
- An integer programming approach for solving a generalized version of the Grundy domination number
- Black-box combinatorial optimization using models with integer-valued minima
- Linear integer programming. Theory, applications, recent developments
- 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
- Distributionally robust optimization. A review on theory and applications
- Integrated rolling stock deadhead routing and timetabling in urban rail transit lines
- Column generation extensions of set covering greedy heuristics
- Branch-and-refine for solving time-expanded MILP formulations
- A subsidy policy to managing hazmat risk in railroad transportation network
- Dissecting the duality gap: the supporting hyperplane interpretation revisited
- 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
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)
