Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T18:03:42.107820Z
Paper Citation Record · LEDGER
As of 10 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2507.09455.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T18:03:42.107820Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
42 of 42 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation f1836932-d81a-4f2c-ba30-7e7a972a44cb · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information PhD thesis, 2007
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 9bc78fc8-d4ce-45bd-a408-62ce99e06255 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Hybrid branching
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation dbcddc5c-e54b-4eb6-80b9-ce2666fd2821 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Branching rules revisited.Opera- tions Research Letters, 33(1):42–54, 2005
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation f6fbd147-bb1e-4b9b-8e00-9dba9f9a4f2d · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information A machine learning-based approximation of strong branching.INFORMS Journal on Computing, 29(1):185–195, 2017
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 8e994ff4-12d1-4b6e-aecc-7c92a2bdf59e · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Citeseer, 1995
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 9aad50d8-63fe-400a-9b9c-90a5ac73f6c7 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Experiments in mixed-integer linear programming
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation c5780a99-4ce0-4037-b65d-5d6d51342175 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Springer, 2016
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation f2ccb5ad-4d79-474a-b49a-a6ec5470ac93 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information PhD thesis, Zuse Institute Berlin (ZIB), 2006
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation b60bc34a-101a-471d-85ed-814ab2ccc819 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Measuring the impact of primal heuristics
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e9434029-75f2-4af9-9a7a-03e07cd3f620 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Primal heuristics in integer program- ming
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation dca0a160-2252-4301-b3f1-69ed491bd5b3 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 7a1eae71-5abb-445d-a4ee-53d0d66c77ec · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information A comparison of heuristics and relaxations for the capacitated plant location problem.European journal of operational research, 50(3):280–297, 1991
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 40d61f8a-09ca-49c2-abe4-f89d2e5b16da · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Lower bounds on the size of general branch-and-bound trees
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 9ba58139-3793-43b8-a402-5a3f29349c0e · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information A theoretical and compu- tational analysis of full strong-branching.Mathematical Programming, 205(1):303–336, 2024
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 67648a06-1211-48df-99bf-4bbdb28ed5aa · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Backdoor branching
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation f4e81dfa-264c-4ead-b488-8eb231937896 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Measuring the impact of branching rules for mixed- integer programming
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation bb3931ad-f4a7-4af8-b2f6-0d41bc4fcbab · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Exact combinatorial optimization with graph convolutional neural networks
Reference 17
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1abd9d32-f4c3-4be2-8e4a-64fa4981d074 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Information-theoretic approaches to branching in search
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 8348d88e-af35-48cf-bd03-293751483432 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Lookahead branching for mixed integer programming
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation c84a3fd4-ce0c-40ba-9896-fdac3551301e · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Identifying minimally infeasible subsystems of inequalities
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation a8cfd160-090e-4553-9f25-5d7e7e4e1515 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco Lübbecke, Hans D
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 76f19b6e-476b-4028-a127-845dd473641c · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Hybrid models for learning to branch
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation b0a0b64b-25ab-47ed-9767-361016d43a81 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Gurobi Optimizer Reference Manual, 2024
Reference 23
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b36526b4-908e-46fb-a739-de851a447c2e · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Learning to branch in mixed integer programming
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 6ccd3abf-c7bb-42bb-8239-e9f00f475888 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Finding backdoors to integer pro- grams: a monte carlo tree search framework
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 590f2e02-ea87-46a1-8a3d-bdb4f853d9a0 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Information-based branching schemes for binary linear mixed integer problems.Mathematical Programming Com- putation, 1:249–293, 2009
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d6593080-e686-4a78-adfd-25253ace5001 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Land and Alison G
Reference 27
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 4aeefd85-87d1-46c5-ad1e-cc85055c197a · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information How important are branching decisions: Fooling mip solvers.Operations Research Letters, 43(3):273–278, 2015
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation ff46db7d-f593-49cb-80f1-ce92ef4ef471 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Towards a universal test suite for combinatorial auction algorithms
Reference 29
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 181018fa-540a-4b71-9c1f-a3464fee49ad · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Look-ahead versus look-back for satisfiability problems
Reference 30
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 9978ad0b-157c-4d0a-a811-d95f524118a3 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information A computational study of search strategies for mixed integer programming.INFORMS Journal on Computing, 11(2):173–187, 1999
Reference 31
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e4f61967-d3d0-4e8f-8322-77ccbcc8897e · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Chaff: Engineering an efficient sat solver
Reference 32
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 410e42cb-2d44-4b53-971e-3f9515c28250 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Solving Mixed Integer Programs Using Neural Networks
Reference 33
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bb147395-e349-4b27-9b53-5039dfdfe358 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Integer and Combinatorial Optimization
Reference 34
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 1add3135-917b-4d0b-b934-5ecadf14db8a · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Computational study of a chance constrained portfolio selection problem.Journal of Optimization Theory and Applica- tions, 142(2):399–416, 2009
Reference 35
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 01e239ee-2c80-4f22-ae75-bb3d98de779d · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Active-constraint variable ordering for faster feasibility of mixed integer linear programs.Mathematical Programming, 110:445–474, 2007
Reference 36
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 957fc1ee-802c-4b2b-80b7-fe173620824d · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Ecole: A gym-like library for machine learning in combinatorial optimization solvers
Reference 37
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation c873cefe-2ccc-4f6a-bd2d-5dec966f9621 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Covering linear program- ming with violations.INFORMS Journal on Computing, 26(3):531–546, 2014
Reference 38
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d73d4540-fd27-4f76-99e0-5d779d71cac8 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Capacitated lot-sizing with extensions: a review
Reference 39
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 8a0bdd04-4b22-489c-a823-20510bd3ef9c · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Non-monotonicity of branching rules with respect to linear relaxations.INFORMS Journal on Computing, 2025
Reference 40
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 2eca4db3-c60d-4acb-962d-27fc889cc2c8 · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems.European Journal of Operational Research, 301(3):828–840, 2022
Reference 41
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 94c02135-a4e2-415d-b46e-95ebd91ccf5a · outbound
Improving Full Strong Branching Decisions by Incorporating Additional Information arbitrary relationships
Reference 42
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
No inbound Pith citation observations are available.