On the public citation graph

Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming

https://doi.org/10.1007/3-540-45578-7_2
0 signed · 154 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118033036openalex-snapshot
Logic‐Based Methods for Optimization
inferredcites →https://doi.org/10.1007/3-540-45349-0_15openalex-snapshot
Cutting Planes in Constraint Programming: An Hybrid Approach
inferredcites →https://doi.org/10.1007/3-540-58601-6_111openalex-snapshot
Logic-based methods for optimization
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_27openalex-snapshot
Tight Cooperation and Its Application in Piecewise Linear Optimization
inferredcites →https://doi.org/10.1007/bf00934810openalex-snapshot
Generalized Benders decomposition
inferredcites →https://doi.org/10.1007/bf01386316openalex-snapshot
Partitioning procedures for solving mixed-variables programming problems
inferredcites →https://doi.org/10.1007/s10107-003-0375-9openalex-snapshot
Logic-based Benders decomposition
inferredcites →https://doi.org/10.1016/s0098-1354(00)00470-1openalex-snapshot
Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems
inferredcites →https://doi.org/10.1016/s0166-218x(99)00100-6openalex-snapshot
Mixed logical-linear programming
inferredcites →https://doi.org/10.1016/s1571-0653(05)80104-0openalex-snapshot
Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers
inferredcites →https://doi.org/10.1017/s0269888900001077openalex-snapshot
A scheme for unifying optimization and constraint satisfaction methods
inferredcites →https://doi.org/10.1017/s0269888901000030openalex-snapshot
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
inferredcites →https://doi.org/10.1023/a:1013195004424openalex-snapshot
A Declarative Modeling Framework that Integrates Solution Methods
inferredcites →https://doi.org/10.1023/a:1014440424150openalex-snapshot
Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers
inferredcites →https://doi.org/10.1023/a:1018904229454openalex-snapshot
A new approach to integrating mixed integer programming and constraint logicprogramming
inferredcites →https://doi.org/10.1023/a:1021136801775openalex-snapshot
Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts
inferredcites →https://doi.org/10.1184/r1/6707129openalex-snapshot
On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization
inferredcites →https://doi.org/10.1287/ijoc.1.1.7openalex-snapshot
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
inferredcites →https://doi.org/10.1287/ijoc.10.3.276openalex-snapshot
Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming
inferredcites →https://doi.org/10.1287/ijoc.10.3.287openalex-snapshot
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
inferredcites →https://doi.org/10.1287/ijoc.13.4.258.9733openalex-snapshot
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
inferredcites →https://doi.org/10.2307/254202openalex-snapshot
The OPL Optimization Programming Language

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.1683889openalex-extracted
Coloring Graphs While Avoiding Monochromatic Cycles
inferred← citeshttps://doi.org/10.2139/ssrn.912231openalex-extracted
A Branch-and-Check Algorithm for Minimizing the Sum of the Weights of the Late Jobs on a Single Machine with Release Dates
inferred← citeshttps://doi.org/10.1002/net.21736openalex-snapshot
Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition
inferred← citeshttps://doi.org/10.1002/net.70015openalex-snapshot
Capacitated Vehicle Routing Problem with a Zone Tariff
inferred← citeshttps://doi.org/10.1007/11493853_10openalex-snapshot
A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
inferred← citeshttps://doi.org/10.1007/11493853_19openalex-snapshot
A Search-Infer-and-Relax Framework for Integrating Solution Methods
inferred← citeshttps://doi.org/10.1007/11564751_105openalex-snapshot
From Linear Relaxations to Global Constraint Propagation
inferred← citeshttps://doi.org/10.1007/11564751_11openalex-snapshot
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
inferred← citeshttps://doi.org/10.1007/11564751_25openalex-snapshot
Planning and Scheduling to Minimize Tardiness
inferred← citeshttps://doi.org/10.1007/11564751_58openalex-snapshot
Integrating Benders Decomposition Within Constraint Programming
inferred← citeshttps://doi.org/10.1007/11754602_10openalex-snapshot
A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
inferred← citeshttps://doi.org/10.1007/11757375_6openalex-snapshot
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_40openalex-snapshot
Constraint Programming Contribution to Benders Decomposition: A Case Study
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_46openalex-snapshot
A Relaxation of the Cumulative Constraint
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_6openalex-snapshot
On the Sum Constraint: Relaxation and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_2openalex-snapshot
Two Generic Schemes for Efficient and Robust Cooperative Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-1043-7_1openalex-snapshot
A Framework for Integrating Solution Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-22788-3_1openalex-snapshot
Logic-Based Benders Decomposition for Large-Scale Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_903-1openalex-snapshot
Logic-Based Benders Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-031-60597-0_17openalex-snapshot
ULD Build-Up Scheduling with Logic-Based Benders Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-032-27242-3_26openalex-snapshot
Introducing Automatically Derived Subproblem Relaxations in a Logic-Based Benders Decomposition Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-27340-2_55openalex-snapshot
A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-33954-2_5openalex-snapshot
Logic-Based Decomposition Methods for the Travelling Purchaser Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_37openalex-snapshot
Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-89656-4_5openalex-snapshot
Logic-Based Benders Decomposition for Two-Stage Flexible Flow Shop Scheduling with Unrelated Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_2openalex-snapshot
SIMPL: A System for Integrating Optimization Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_24openalex-snapshot
Problem Decomposition for Traffic Diversions
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_14openalex-snapshot
Combinatorial Benders’ Cuts
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_14openalex-snapshot
Decomposition and Learning for a Hard Real Time Task Allocation Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_24openalex-snapshot
A Hybrid Method for Planning and Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_65openalex-snapshot
Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-14355-7_24openalex-snapshot
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-14536-0_12openalex-snapshot
Integrierte Programm- und Personaleinsatzplanung sequenzierter Produktionslinien
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_10openalex-snapshot
Checking-Up on Branch-and-Check
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_22openalex-snapshot
Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
inferred← citeshttps://doi.org/10.1007/s10107-003-0375-9openalex-snapshot
Logic-based Benders decomposition
inferred← citeshttps://doi.org/10.1007/s10107-003-0420-8openalex-snapshot
A polyhedral study of the cardinality constrained knapsack problem
inferred← citeshttps://doi.org/10.1007/s10288-011-0157-9openalex-snapshot
Algorithms for selection and graph-coloring problems with applications in marketing and micro-economics
inferred← citeshttps://doi.org/10.1007/s10479-011-1031-zopenalex-snapshot
Single-facility scheduling by logic-based Benders decomposition
inferred← citeshttps://doi.org/10.1007/s10479-022-04891-1openalex-snapshot
Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
inferred← citeshttps://doi.org/10.1007/s10601-005-2812-2openalex-snapshot
A Hybrid Method for the Planning and Scheduling
inferred← citeshttps://doi.org/10.1007/s10601-006-8060-2openalex-snapshot
An Integrated Method for Planning and Scheduling to Minimize Tardiness
inferred← citeshttps://doi.org/10.1007/s10601-011-9115-6openalex-snapshot
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey
inferred← citeshttps://doi.org/10.1007/s10601-016-9241-2openalex-snapshot
A branch-and-price-and-check model for the vehicle routing problem with location congestion
inferred← citeshttps://doi.org/10.1007/s10601-017-9280-3openalex-snapshot
Constraint programming and operations research
inferred← citeshttps://doi.org/10.1007/s10732-019-09423-yopenalex-snapshot
The vehicle routing problem with cross-docking and resource constraints
inferred← citeshttps://doi.org/10.1007/s10766-007-0032-7openalex-snapshot
A Fast and Accurate Technique for Mapping Parallel Applications on Stream-Oriented MPSoC Platforms with Communication Awareness
inferred← citeshttps://doi.org/10.1007/s10951-008-0079-3openalex-snapshot
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
inferred← citeshttps://doi.org/10.1007/s10951-010-0184-yopenalex-snapshot
Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
inferred← citeshttps://doi.org/10.1007/s11081-020-09575-yopenalex-snapshot
Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
inferred← citeshttps://doi.org/10.1007/s12532-026-00331-4openalex-snapshot
A sequential Benders-based mixed-integer quadratic programming algorithm and its implementation in the CAMINO toolbox
inferred← citeshttps://doi.org/10.1007/s43069-020-00023-2openalex-snapshot
Nutmeg: a MIP and CP Hybrid Solver Using Branch-and-Check
inferred← citeshttps://doi.org/10.1007/s43069-023-00242-3openalex-snapshot
Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders’ Decomposition
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106641openalex-snapshot
Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cirp.2011.03.044openalex-snapshot
Planning assistance for pearl chain forecasts and personnel assignment planning of sequenced assembly lines
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2005.09.011openalex-snapshot
A decomposition framework for the scheduling of single- and multi-stage processes
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.03.004openalex-snapshot
Satisfiability modulo theories for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.cor.2005.01.010openalex-snapshot
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.004openalex-snapshot
Scheduling and routing of automated guided vehicles: A hybrid approach
inferred← citeshttps://doi.org/10.1016/j.cor.2016.09.009openalex-snapshot
Logic based Benders' decomposition for orthogonal stock cutting problems
inferred← citeshttps://doi.org/10.1016/j.cor.2017.03.004openalex-snapshot
A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
inferred← citeshttps://doi.org/10.1016/j.cor.2017.07.001openalex-snapshot
A branch-and-check approach for a wind turbine maintenance scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.03.008openalex-snapshot
Solving a selective dial-a-ride problem with logic-based Benders decomposition
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105566openalex-snapshot
Branch-and-check approaches for the tourist trip design problem with rich constraints
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106392openalex-snapshot
Logic-based benders decomposition for wildfire suppression
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.05.004openalex-snapshot
Cutting plane algorithms for solving a stochastic edge-partition problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.06.078openalex-snapshot
A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.12.050openalex-snapshot
Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.02.005openalex-snapshot
Supplier selection in the processed food industry under uncertainty
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.04.058openalex-snapshot
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.08.024openalex-snapshot
Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.12.005openalex-snapshot
The Benders decomposition algorithm: A literature review
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.10.014openalex-snapshot
Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.08.037openalex-snapshot
Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.12.004openalex-snapshot
Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.10.014openalex-snapshot
The multiphase course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.07.032openalex-snapshot
Combining optimisation and simulation using logic-based Benders decomposition
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.07.056openalex-snapshot
Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125996openalex-snapshot
A new branch-and-Benders-cut algorithm for the time-dependent vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.ijpe.2019.07.006openalex-snapshot
Branch-and-check methods for multi-level operating room planning and scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2007.02.032openalex-snapshot
Solving a real-time allocation problem with constraint programming
inferred← citeshttps://doi.org/10.1016/j.omega.2019.03.001openalex-snapshot
Reformulation, linearization, and decomposition techniques for balanced distributed operating room scheduling
inferred← citeshttps://doi.org/10.1016/j.ssci.2022.105867openalex-snapshot
An integrated decision model for managing hospital evacuation in response to an extreme flood event: A case study of the Hawkesbury‐Nepean River, NSW, Australia
inferred← citeshttps://doi.org/10.1016/j.trb.2026.103547openalex-snapshot
An improved branch-and-Benders-cut algorithm for two-stage scenario-based robust winner determination problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12010-6openalex-snapshot
Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80019-2openalex-snapshot
Operations Research Methods in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.008openalex-snapshot
Optimization Methods in Logic
inferred← citeshttps://doi.org/10.1017/s0269888916000254openalex-snapshot
Logic-based Benders decomposition for planning and scheduling: a computational analysis
inferred← citeshttps://doi.org/10.1017/s1471068409003780openalex-snapshot
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
inferred← citeshttps://doi.org/10.1023/a:1021145103592openalex-snapshot
Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach
inferred← citeshttps://doi.org/10.1080/00207543.2026.2718454openalex-snapshot
Enhanced branch-and-check for extended flexible job shop scheduling problem with arbitrary precedence graphs
inferred← citeshttps://doi.org/10.1080/03052151003759117openalex-snapshot
A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions
inferred← citeshttps://doi.org/10.1080/24725854.2025.2491495openalex-snapshot
Nested logic-based Benders decomposition for disaster preparedness planning with horizontal coordination
inferred← citeshttps://doi.org/10.1109/date.2006.243950openalex-snapshot
Communication-aware allocation and scheduling framework for stream-oriented multi-processor systems-on-chip
inferred← citeshttps://doi.org/10.1109/jsyst.2017.2775610openalex-snapshot
A Branch-and-Cut Benders Decomposition Algorithm for Transmission Expansion Planning
inferred← citeshttps://doi.org/10.1109/samos.2014.6893224openalex-snapshot
An automotive specific MILP model targeting power-aware function partitioning
inferred← citeshttps://doi.org/10.1109/tase.2019.2894093openalex-snapshot
A Hybrid MIP–CP Approach to Multistage Scheduling Problem in Continuous Casting and Hot-Rolling Processes
inferred← citeshttps://doi.org/10.1109/tase.2025.3648318openalex-snapshot
Optimizing Three-Dimensional Bag Packing
inferred← citeshttps://doi.org/10.1111/poms.13397openalex-snapshot
Increased Surgical Capacity without Additional Resources: Generalized Operating Room Planning and Scheduling
inferred← citeshttps://doi.org/10.1145/1289927.1289940openalex-snapshot
Communication-aware stochastic allocation and scheduling framework for conditional task graphs in multi-processor systems-on-chip
inferred← citeshttps://doi.org/10.11575/prism/24762openalex-snapshot
A Hybrid Release Planning Method for Accommodating Advanced Feature Dependencies
inferred← citeshttps://doi.org/10.11606/d.55.2023.tde-05032024-084525openalex-snapshot
Last Mile Delivery Box Packing
inferred← citeshttps://doi.org/10.12794/metadc804902openalex-snapshot
Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies
inferred← citeshttps://doi.org/10.1287/ijoc.1110.0466openalex-snapshot
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.295.2828openalex-snapshot
Logic, Optimization, and Constraint Programming
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0666openalex-snapshot
Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
inferred← citeshttps://doi.org/10.1287/ijoc.2020.1026openalex-snapshot
Team Orienteering with Time-Varying Profit
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1079openalex-snapshot
Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems
inferred← citeshttps://doi.org/10.1287/ijoc.2022.0298openalex-snapshot
A Decomposition Method for the Group-Based Quay Crane Scheduling Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1184openalex-snapshot
Stochastic Planning and Scheduling with Logic-Based Benders Decomposition
inferred← citeshttps://doi.org/10.1287/opre.1060.0286openalex-snapshot
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
inferred← citeshttps://doi.org/10.1287/opre.1060.0371openalex-snapshot
Planning and Scheduling by Logic-Based Benders Decomposition
inferred← citeshttps://doi.org/10.1287/opre.1090.0733openalex-snapshot
An Integrated Solver for Optimization Problems
inferred← citeshttps://doi.org/10.1287/trsc.2017.0762openalex-snapshot
Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach
inferred← citeshttps://doi.org/10.1287/trsc.2018.0830openalex-snapshot
A Logic-Based Benders Approach to Home Healthcare Delivery
inferred← citeshttps://doi.org/10.1287/trsc.2022.0110openalex-snapshot
Formation and Routing of Worker Teams for Airport Ground Handling Operations: A Branch-and-Price-and-Check Approach
inferred← citeshttps://doi.org/10.1287/trsc.2022.1184openalex-snapshot
Capturing Travel Mode Adoption in Designing On-Demand Multimodal Transit Systems
inferred← citeshttps://doi.org/10.1287/trsc.2025.0291openalex-snapshot
Short-Term Rolling Stock Scheduling and Platform Assignment: A Branch-and-Check Method
inferred← citeshttps://doi.org/10.14279/depositonce-3602openalex-snapshot
Hybrid Solving Techniques for Project Scheduling Problems
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11525openalex-snapshot
A Recursive Scenario Decomposition Algorithm for Combinatorial Multistage Stochastic Optimisation Problems
inferred← citeshttps://doi.org/10.1613/jair.5306openalex-snapshot
Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots
inferred← citeshttps://doi.org/10.17877/de290r-15874openalex-snapshot
Scheduling of tests on vehicle prototypes
inferred← citeshttps://doi.org/10.23919/acc60939.2024.10644418openalex-snapshot
Machine Learning-Based Initialization of Generalized Benders Decomposition for Mixed Integer Model Predictive Control
inferred← citeshttps://doi.org/10.36334/modsim.2021.m1.esmaeilbeigiopenalex-snapshot
Hydrogen bus route planning in regional Victoria
inferred← citeshttps://doi.org/10.48550/arxiv.0904.2136openalex-snapshot
On the Cooperation of the Constraint Domains H, R and FD in CFLP
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13975openalex-snapshot
A Brief Tour of Logic and Optimization
inferred← citeshttps://doi.org/10.5539/ijbm.v19n3p1openalex-snapshot
Optimization Models for Operations and Maintenance of Offshore Wind Turbines Based on Artificial Intelligence and Operations Research: A Systematic Literature Review
inferred← citeshttps://doi.org/10.70675/bff23ab4z8e47z43bcz84bcz7de590386fe7openalex-snapshot
Hybrid combinatorial optimization and machine learning algorithms for energy efficient water networks
inferred← citeshttps://doi.org/10.70675/c114e648z6977z4245zb479z268c4e1a7a8copenalex-snapshot
Techniques de décisions hiérarchiques pour l’allocation et l’ordonnancement de tâches
inferred← citeshttps://doi.org/10.70675/c64b1976z30baz4ca5z8f24z3e9617aa94c1openalex-snapshot
Contrôle optimal et dimensionnement des stations de pompage dans les réseaux de distribution d'eau potable
inferred← citeshttps://doi.org/10.7939/r37h1f277openalex-snapshot
Parallel Accelerated Optimization Techniques for Large-Scale Power System Planning and Operation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.