The following pages link to (Q4254875):
Displaying 50 items.
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Extension of model-based classification for binary data when training and test populations differ (Q5123570) (← links)
- Integer Programming (Q5130591) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- Adaptive two-stage optimal designs for phase II clinical studies that allow early futility stopping (Q5227806) (← links)
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow (Q5256763) (← links)
- Path inequalities for the vehicle routing problem with time windows (Q5295485) (← links)
- Optimal Migration Planning of Telecommunication Equipment (Q5356972) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- A branch-and-price algorithm for a targeting problem (Q5386381) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
- Cyclic preference scheduling for nurses using branch and price (Q5436481) (← links)
- A MEAN-VARIANCE-SKEWNESS MODEL: ALGORITHM AND APPLICATIONS (Q5462699) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- A genetic algorithm applied to optimal allocation in stratified sampling (Q5867419) (← links)
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Constraint programming-based column generation (Q5902286) (← links)
- Constraint programming-based column generation (Q5919991) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- A multi-period network design problem for cellular telecommunication systems (Q5945859) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- Global optimization of objective functions represented by ReLU networks (Q6053800) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
- Learning monotone preferences using a majority rule sorting model (Q6066613) (← links)
- A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
- A new formulation for the liner shipping network design problem (Q6070113) (← links)
- An integer linear programming approach to solving the Eternity puzzle (Q6076354) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- A Lagrangean relaxation approach to lifetime maximization of directional sensor networks (Q6087140) (← links)
- Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)
- On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management (Q6092540) (← links)
- Limiting flexibility in nonparametric efficiency evaluations: an ex post \(k\)-centroid clustering approach (Q6096584) (← links)
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers (Q6102725) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones (Q6130706) (← links)
- Methods for the graph realization problem (Q6152848) (← links)
- Pipeline network design for gathering unconventional oil and gas production using mathematical optimization (Q6159498) (← links)
- A strongly polynomial algorithm for the minimum maximum flow degree problem (Q6161285) (← links)
- An efficient mixed integer linear programming model for the minimum spanning tree problem (Q6162004) (← links)
- Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries (Q6164363) (← links)
- Economic lot sizing problem with tank scheduling (Q6167403) (← links)
- Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty (Q6167875) (← links)
- Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)
