Improving Discrete Model Representations via Symmetry Considerations
From MaRDI portal
Publication:3114738
DOI10.1287/mnsc.47.10.1396.10265zbMath1232.90309OpenAlexW2159272988MaRDI QIDQ3114738
J. Cole Smith, Hanif D. Sherali
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.47.10.1396.10265
Related Items
Symmetry in Mathematical Programming, A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times, An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems, Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms, Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations, Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations, ILP approaches to the blockmodel problem, A tabu search algorithm for application placement in computer clustering, Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations, Solution methods for the tray optimization problem, A mixed-integer mathematical modeling approach to exam timetabling, Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design, Lexicographical order in integer programming, Query batching optimization in database systems, The task assignment problem for unrestricted movement between workstation groups, Polytopes associated with symmetry handling, Symmetry-driven network reconstruction through pseudobalanced coloring optimization, A branch-and-cut approach for the distributed no-wait flowshop scheduling problem, A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems, Unsupervised parallel machines scheduling with tool switches, Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen, Tight bounds for the identical parallel machine‐scheduling problem: Part II, Minimum‐cost flow problems having arc‐activation costs, Constraint Orbital Branching, Orbital branching, Complexity, algorithmic, and computational aspects of a dial-a-ride type problem, Optimizing high-level nuclear waste disposal within a deep geologic repository, A Matheuristic for the Multivehicle Inventory Routing Problem, Resources synchronization in a full truckload pickup and delivery problem: an exact approach, Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, The stop-and-drop problem in nonprofit food distribution networks, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Using symmetry to optimize over the Sherali-Adams relaxation, Stabilizer-based symmetry breaking constraints for mathematical programs, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain, A note on a symmetrical set covering problem: the lottery problem, A computational comparison of symmetry handling methods for mixed integer programs, A quantitative approach for scheduling activities to reduce set-up in multiple machine lines, Intermediate integer programming representations using value disjunctions, A branch-and-price algorithm for a vehicle routing with demand allocation problem, A branch-and-price-and-cut method for computing an optimal bramble, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, Service location grouping and pricing in transportation: application in air cargo, Enhancing set constraint solvers with lexicographic bounds, An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections, Integer programming formulations for the minimum weighted maximal matching problem, A reactive GRASP with path relinking for capacitated clustering, Two branch-and-bound algorithms for the robust parallel machine scheduling problem, Clustering clinical departments for wards to achieve a prespecified blocking probability, Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain, A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity, An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs, A matheuristic for parallel machine scheduling with tool replacements, Stochastic programming for nurse assignment, Complementary column generation and bounding approaches for set partitioning formulations, A new multi-objective mathematical model for the high-level synthesis of integrated circuits, Parallel machine scheduling with tool loading, On the geometry of symmetry breaking inequalities, Reformulations in Mathematical Programming: Definitions and Systematics, A ring-mesh topology design problem for optical transport networks, Theoretical and computational advances for network diversion, On the geometry of symmetry breaking inequalities, Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem, Maximizing the minimum completion time on parallel machines, Unnamed Item, Cutting plane algorithms for solving a stochastic edge-partition problem, The impact of distribution system characteristics on computational tractability, On the maximum small-world subgraph problem, Automatic Generation of Symmetry-Breaking Constraints, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, A global optimization RLT-based approach for solving the hard clustering problem, Modified orbital branching for structured symmetry with an application to unit commitment, Profitable mixed capacitated arc routing and related problems, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation, The multiphase course timetabling problem, Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor, Integer-programming software systems
Uses Software
